SDP-Based Moment Closure for Epidemic Processes on Networks

被引:3
|
作者
Chen, Ximing [1 ]
Ogura, Masaki [2 ]
Preciado, Victor M. [1 ]
机构
[1] Univ Penn, Dept Elect & Syst Engn, Philadelphia, PA 19104 USA
[2] Osaka Univ, Grad Sch Informat Sci & Technol, Suita, Osaka 5650871, Japan
基金
日本学术振兴会;
关键词
Complex networks; epidemics; stochastic processes; moment closure; K-moment problem; semidefinite programming; SPREADING PROCESSES; COMPLEX; MODEL;
D O I
10.1109/TNSE.2020.2998491
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we analyze the (exact) stochastic dynamics of spreading processes taking place in complex networks. The analysis of this dynamics is, in general, very challenging since its state space grows exponentially with the network size. A common approach to overcome this challenge is to apply moment-closure techniques, such as the popular mean-field approach, to approximate the exact stochastic dynamics via ordinary differential equations. However, most existing moment-closure techniques do not provide quantitative guarantees on the quality of the approximation, limiting the applicability of these techniques. To overcome this limitation, we propose a novel moment-closure technique with explicit quality guarantees based on recent results relating the multidimensional moment problem with semidefinite programming. We illustrate how this technique can be used to derive upper and lower bounds on the exact (stochastic) dynamics of a variety of networked spreading processes, such as the SIS, SI, and SIR models. Moreover, we provide a simplified version of this moment-closure technique to approximate the dynamics of the probabilities of infection of each node using a linear number of piecewise-affine differential equations. Finally, we demonstrate the validity of our bounds via numerical simulations in a real-world social network.
引用
收藏
页码:2850 / 2865
页数:16
相关论文
共 50 条
  • [1] A new optimization in SDP-based learning
    Hu, En-Liang
    Wang, Bo
    [J]. NEUROCOMPUTING, 2019, 365 : 10 - 20
  • [2] SDP-based Adaptation for Quality Control in Adaptive Streaming
    Duong, Anh H.
    Nguyen, Thoa
    Vu, Thang
    Do, Tung T.
    Nam Pham Ngoc
    Truong Cong Thang
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, MANAGEMENT AND TELECOMMUNICATIONS (COMMANTEL), 2015, : 194 - 199
  • [3] An SDP-based approach for computing the stability number of a graph
    Gaar, Elisabeth
    Siebenhofer, Melanie
    Wiegele, Angelika
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2022, 95 (01) : 141 - 161
  • [4] A Dynamic Reward Model using SDP-based Mechanism
    Hu, Wan-Hsun
    Chen, Yin-Che
    Lu, Fang-Sun
    Jeng, Jeu-Yih
    [J]. 2017 31ST IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (IEEE WAINA 2017), 2017, : 467 - 471
  • [5] An SDP-based approach for computing the stability number of a graph
    Elisabeth Gaar
    Melanie Siebenhofer
    Angelika Wiegele
    [J]. Mathematical Methods of Operations Research, 2022, 95 : 141 - 161
  • [6] SDP-based approach to monocular reconstruction of inextensible surfaces
    Hosseini, S. Jafar
    Araujo, Helder
    [J]. IET COMPUTER VISION, 2017, 11 (01) : 43 - 49
  • [7] SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
    Agnarsson, Geir
    Halldorsson, Magnus M.
    Losievskaja, Elena
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 12 - +
  • [8] Dynamic access control method for SDP-based network environments
    Hyunjin You
    Doochan Ko
    Daniel Kim
    Richard Wong
    Inwhee Joe
    [J]. EURASIP Journal on Wireless Communications and Networking, 2023
  • [9] An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
    Lee, Yin Tat
    Sun, He
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 678 - 687
  • [10] SDP-based bounds for graph partition via extended ADMM
    Angelika Wiegele
    Shudian Zhao
    [J]. Computational Optimization and Applications, 2022, 82 : 251 - 291