Scalable Estimation of Epidemic Thresholds via Node Sampling

被引:0
|
作者
Anirban Dasgupta
Srijan Sengupta
机构
[1] Indian Institute of Technology,Computer Science and Engineering
[2] Gandhinagar,undefined
[3] Statistics,undefined
[4] North Carolina State University,undefined
来源
Sankhya A | 2022年 / 84卷
关键词
Epidemic threshold; Networks; Sampling; Random walk; Configuration model; Epidemiology.; 62F10 (primary); 68W20, 68W25;
D O I
暂无
中图分类号
学科分类号
摘要
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 transmission 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.
引用
收藏
页码:321 / 344
页数:23
相关论文
共 50 条
  • [1] Scalable Estimation of Epidemic Thresholds via Node Sampling
    Dasgupta, Anirban
    Sengupta, Srijan
    SANKHYA-SERIES A-MATHEMATICAL STATISTICS AND PROBABILITY, 2022, 84 (01): : 321 - 344
  • [2] Scalable Betweenness Centrality Maximization via Sampling
    Mahmoody, Ahmad
    Tsourakakis, Charalampos E.
    Upfal, Eli
    KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 1765 - 1773
  • [3] Node sampling for protein complex estimation in bait-prey graphs
    Scholtens, Denise M.
    Spencer, Bruce D.
    STATISTICAL APPLICATIONS IN GENETICS AND MOLECULAR BIOLOGY, 2015, 14 (04) : 391 - 411
  • [4] Precisely identifying the epidemic thresholds in real networks via asynchronous updating
    Cai, Shi-Min
    Chen, Xuan-Hao
    Ye, Xi-Jun
    Tang, Ming
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 361 : 377 - 388
  • [5] Supports estimation via graph sampling
    Wang, Xin
    Shi, Jun-Hao
    Zou, Jie-Jun
    Shen, Ling-Zhen
    Lan, Zhuo
    Fang, Yu
    Xie, Wen -Bo
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 240
  • [6] Epidemic thresholds and human mobility
    Pardo-Araujo, Marta
    Garcia-Garcia, David
    Alonso, David
    Bartumeus, Frederic
    SCIENTIFIC REPORTS, 2023, 13 (01)
  • [7] Epidemic thresholds in real networks
    Chakrabarti, Deepayan
    Wang, Yang
    Wang, Chenxi
    Leskovec, Jurij
    Faloutsos, Christos
    ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2008, 10 (04)
  • [8] Toward epidemic thresholds on temporal networks: a review and open questions
    Jack Leitch
    Kathleen A. Alexander
    Srijan Sengupta
    Applied Network Science, 4
  • [9] Toward epidemic thresholds on temporal networks: a review and open questions
    Leitch, Jack
    Alexander, Kathleen A.
    Sengupta, Srijan
    APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [10] SCALABLE UNIFORM GRAPH SAMPLING BY LOCAL COMPUTATION
    Elisa Schaeffer, Satu
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2010, 32 (05) : 2937 - 2963