Bayesian Inference of Spreading Processes on Networks
Not on the map. Why?
Abstract (arXiv)
Infectious diseases are studied to understand their spreading mechanisms, to evaluate control strategies and to predict the risk and course of future outbreaks. Because people only interact with a small number of individuals, and because the structure of these interactions matters for spreading processes, the pairwise relationships between individuals in a population can be usefully represented by a network. Although the underlying processes of transmission are different, the network approach can be used to study the spread of pathogens in a contact network or the spread of rumors in an online social network. We study simulated simple and complex epidemics on synthetic networks and on two empirical networks, a social / contact network in an Indian village and an online social network in the U.S. Our goal is to learn simultaneously about the spreading process parameters and the source node (first infected node) of the epidemic, given a fixed and known network structure, and observations about state of nodes at several points in time. Our inference scheme is based on approximate Bayesian computation (ABC), an inference technique for complex models with likelihood functions that are either expensive to evaluate or analytically intractable. ABC enables us to adopt a Bayesian approach to the problem despite the posterior distribution being very complex. Our method is agnostic about the topology of the network and the nature of the spreading process. It generally performs well and, somewhat counter-intuitively, the inference problem appears to be easier on more heterogeneous network topologies, which enhances its future applicability to real-world settings where few networks have homogeneous topologies.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.
5 papers.
- 2023Learning of networked spreading models from noisy and incomplete datacited by 2
- 2025Learning hidden cascades via classificationcited by 1
- 2024Link Me Baby One More Time: Social Music Discovery on Spotifycited by 0
- 2025Graph Neural Networks for Source Detection: A Review and Benchmark Studycited by 0
- 2026Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamicscited by 0
- 2026Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamics2 Oct 2026
- 2025Graph Neural Networks for Source Detection: A Review and Benchmark Study18 Dec 2025
- 2025Learning hidden cascades via classification16 May 2025
- 2024Link Me Baby One More Time: Social Music Discovery on Spotify16 Jan 2024
- 2023Learning of networked spreading models from noisy and incomplete data20 Dec 2023