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 条
  • [41] Node Scheduling and Compressed Sampling for Event Reporting in WSNs
    Singh, Vishal Krishna
    Kumar, Manish
    Verma, Shekhar
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (03): : 418 - 431
  • [42] Sampling nodes and hyperedges via random walks on large hypergraphs
    Kazuki Nakajima
    Masanao Kodakari
    Masaki Aida
    Applied Network Science, 10 (1)
  • [43] The Relative Complexity of Maximum Likelihood Estimation, MAP Estimation, and Sampling
    Tosh, Christopher
    Dasgupta, Sanjoy
    CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
  • [44] The error estimation of sampling in wavelet subspaces
    Chen, W
    Chen, J
    Itoh, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (05) : 835 - 841
  • [45] Push- and Pull-Based Epidemic Spreading in Networks: Thresholds and Deeper Insights
    Xu, Shouhuai
    Lu, Wenlian
    Xu, Li
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2012, 7 (03)
  • [46] SAMPLING AND ESTIMATION FOR (SPARSE) EXCHANGEABLE GRAPHS
    Veitch, Victor
    Roy, Daniel M.
    ANNALS OF STATISTICS, 2019, 47 (06) : 3274 - 3299
  • [47] Sampling Requirements for Stable Autoregressive Estimation
    Kazemipour, Abbas
    Miran, Sina
    Pal, Piya
    Babadi, Behtash
    Wu, Min
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (09) : 2333 - 2347
  • [48] ESTIMATION OF SAMPLING BIAS BETWEEN DIFFERENT SAMPLING PROTOCOLS ON CONTAMINATED LAND
    RAMSEY, MH
    ARGYRAKI, A
    THOMPSON, M
    ANALYST, 1995, 120 (05) : 1353 - 1356
  • [49] Scalable Node-Level Computation Kernels for Parallel Exact Inference
    Xia, Yinglong
    Prasanna, Viktor K.
    IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (01) : 103 - 115
  • [50] Epidemic dynamics on metapopulation networks with node2vec mobility
    Meng, Lingqi
    Masuda, Naoki
    JOURNAL OF THEORETICAL BIOLOGY, 2022, 534