Scalable estimation of epidemic thresholds via node sampling
From MaRDI portal
Abstract: Infectious or contagious diseases can be transmitted from one person to another through social contact networks. In today's interconnected global society, such contagion processes can cause global public health hazards, as exemplified by the ongoing Covid-19 pandemic. It is therefore of great practical relevance to investigate the network trans-mission of contagious diseases from the perspective of statistical inference. An important and widely studied boundary condition for contagion processes over networks is the so-called epidemic threshold. The epidemic threshold plays a key role in determining whether a pathogen introduced into a social contact network will cause an epidemic or die out. In this paper, we investigate epidemic thresholds from the perspective of statistical network inference. We identify two major challenges that are caused by high computational and sampling complexity of the epidemic threshold. We develop two statistically accurate and computationally efficient approximation techniques to address these issues under the Chung-Lu modeling framework. The second approximation, which is based on random walk sampling, further enjoys the advantage of requiring data on a vanishingly small fraction of nodes. We establish theoretical guarantees for both methods and demonstrate their empirical superiority.
Recommendations
Cites work
- A Block Model for Node Popularity in Networks with Community Structure
- A nonparametric two-sample hypothesis testing problem for random graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- A random graph model for massive graphs
- Chernoff-type bound for finite Markov chains
- Consistency of community detection in networks under degree-corrected stochastic block models
- Contributions to the mathematical theory of epidemics. III.—Further studies of the problem of endemicity
- Eigenvalues of random power law graphs
- Emergence of Scaling in Random Networks
- Hypothesis testing for automated community detection in networks
- Large graph limit for an SIR process in random network with heterogeneous connectivity
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- Latent Space Approaches to Social Network Analysis
- Likelihood-based model selection for stochastic block models
- Mathematical models in population biology and epidemiology
- Network theory and SARS: predicting outbreak diversity
- On the spectra of general random graphs
- Pulse vaccination strategy in the SIR epidemic model
- Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in heterogeneous networks
- Spectral radii of sparse random matrices
- The average distances in random graphs with given expected degrees
- The collected works of Wassily Hoeffding. Ed. by N. I. Fisher and P. K. Sen
- The implications of network structure for epidemic dynamics
- The mathematics of infectious diseases
Cited in
(3)
This page was built for publication: Scalable estimation of epidemic thresholds via node sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121712)