Disease Transmission on Random Graphs Using Edge‐Based Percolation

ABSTRACT Edge‐based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here, we begin by reviewing the seminal works on this field in previous studies by Newman et al. (2002, 2003) and Miller et al. (2012). We present a unified discussion of the theoretical background behind these models, including a detailed derivation of some of the major results. We also demonstrate the connections between these studies and the classical literature in random graph theory as detailed in Molloy and Reed (1995, 1998). Finally, we also present an accompanying R package that takes epidemic and network parameters as input and generates estimates of the epidemic trajectory and final size. This manuscript and the R package were developed to help researchers easily understand and use network models to investigate the interaction between different community structures and disease transmission.

Authors

Institutions

Publication Details

Journal
Mathematical Methods in the Applied Sciences
Published
2025-04-14
DOI
https://doi.org/10.1002/mma.10963
Citations
3
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
3.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Disease Transmission on Random Graphs Using Edge‐Based Percolation

F. M. G. Magpantay, Sicheng Zhao
3 citations
Mathematical Methods in the Applied Sciences
Complex Network Analysis Techniques
3.97
article

Disease Transmission on Random Graphs Using Edge‐Based Percolation

F. M. G. Magpantay, Sicheng Zhao
article en
3 citations

Abstract

ABSTRACT Edge‐based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here, we begin by reviewing the seminal works on this field in previous studies by Newman et al. (2002, 2003) and Miller et al. (2012). We present a unified discussion of the theoretical background behind these models, including a detailed derivation of some of the major results. We also demonstrate the connections between these studies and the classical literature in random graph theory as detailed in Molloy and Reed (1995, 1998). Finally, we also present an accompanying R package that takes epidemic and network parameters as input and generates estimates of the epidemic trajectory and final size. This manuscript and the R package were developed to help researchers easily understand and use network models to investigate the interaction between different community structures and disease transmission.

Mathematical Methods in the Applied SciencesVol. 48(11)
Queen's University (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 7%
Complex Network Analysis Techniques
3.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.