Inferring Hidden Diffusion Networks from Cascade Timestamps

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 2142 papers179 conceptsfrozen 2026-10-04

In many real-world systems, we can observe the effects of a network without ever seeing the network itself. We see a news story break on one blog and then appear on others; we see a virus move through a city; we see a meme go viral on social media. In these cases, we have a list of "infection times"—the exact moment each node was activated—but the underlying "who-infected-whom" structure remains a black box.

The research direction of Network Inference seeks to solve this inverse problem: reconstructing the latent topology of a network using only the temporal signatures of information or disease cascades.

The Intuition: Time as a Proxy for Influence

The core insight driving this field is that time delays are not random; they are encoded with structural information. If Node A consistently activates just before Node B across many different cascades, there is a high probability of a directed edge from A to B.

As Hamid R. Rabiee and Motahareh Eslami Mehdiabadi argue in Diffusion-Aware Sampling and Estimation in Information Diffusion Networks, temporal delays serve as a reliable proxy for the underlying spatial structure. Shorter intervals between infections suggest a stronger, more direct link. By aggregating these temporal patterns across thousands of cascades, researchers can "triangulate" the most likely network structure.

From Combinatorics to Optimization

Early attempts to reconstruct networks were often computationally intractable because the number of possible network configurations grows exponentially with the number of nodes. The breakthrough came when researchers reframed the problem as an optimization task.

In Inferring networks of diffusion and influence, Jure Leskovec, Manuel Gomez-Rodriguez, and Andreas Krause introduced NETINF. They proved that the network inference problem exhibits submodularity—a property similar to convexity in continuous space. This allowed them to use a greedy algorithm that is provably near-optimal and scales to millions of nodes.

Simultaneously, Jure Leskovec and Seth A. Myers developed ConNIe (On the Convexity of Latent Social Network Inference), which transforms the inference into a convex optimization problem. By applying $\ell_1$-regularization, these models don't just find any network; they find the simplest (sparsest) network that explains the data, mirroring the reality that most social and biological networks are not densely connected.

Modeling "Spiky" Dynamics with Point Processes

While optimization methods work well for static networks, real-world influence is often dynamic and "spiky." To capture this, researchers like Hongyuan Zha and Le Song turned to Hawkes Processes.

A Hawkes process is a "self-exciting" point process where the occurrence of one event increases the probability of future events. In Learning Social Infectivity in Sparse Low-rank Networks Using Multi-dimensional Hawkes Processes, the authors use these processes to distinguish between coincidental timing and genuine causal influence. This allows the model to learn a "weight matrix" of infectivity, identifying not just if a link exists, but how strong that influence is in real-time.

Handling the "Unobserved"

A recurring challenge in this field is the presence of hidden variables. Often, we don't see every node in a cascade, or we don't know which specific "layer" of a network (e.g., professional vs. personal) triggered a transmission.

Why It Matters: Beyond Reconstruction

The goal of inferring these latent networks is rarely just to draw a map; it is to intervene.

By identifying "super-spreaders" in an unknown network using only a few epidemic traces, as explored by Elchanan Mossel and Anirudh Sridhar in Finding Super-spreaders in Network Cascades, public health officials can optimize vaccination strategies even when they don't have a complete contact graph. Similarly, understanding the latent influence of socialbots (#DebateNight) or the structural virality of hate speech (The Virality of Hate Speech on Social Media) allows for more effective moderation and counter-messaging in digital spaces.

Papers in this version

Showing 60 of 142 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 95 papers
  2. Version 1 · 2026-10-04 · 142 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_latent_network_inference_865906ab,
  title = {latent network inference},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/latent-network-inference/rdr_865906ab0d734477989b50e691446524},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_inferring_hidden_diffusion_networks_from_865906ab_v1,
  title = {Inferring Hidden Diffusion Networks from Cascade Timestamps},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/inferring-hidden-diffusion-networks-from-cascade-timestamps/rdr_865906ab0d734477989b50e691446524/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}