Name
Abstract | ||
|---|---|---|
In this paper, we analyse the (exact) stochastic dynamics of spreading processes in complex networks in order to design strategies to eradicate the spread. A common approach for analysing the dynamics of stochastic spreading models is to apply first-order moment-closure techniques, such as mean-field approximations. However, these moment-closure techniques do not provide quantitative guarantees on the quality of approximation. In this paper, we propose a general moment-closure technique with quality guarantees based on recent results relating the truncated moment problem with semidefinite programming. As a particular application of our technique, we provide upper and lower bounds on the exact dynamics of the SIS spreading process. We demonstrate the validity of our bounds via numerical simulations of spreading process on complex networks. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | Mathematical optimization,Random variable,Computer science,Upper and lower bounds,Stochastic dynamics,Stochastic process,Complex network,Moment problem,Semidefinite programming |
DocType | ISSN | Citations |
Conference | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ximing Chen | 1 | 4 | 2.12 |
| Masaki Ogura | 2 | 44 | 13.38 |
| Khem Raj Ghusinga | 3 | 5 | 4.07 |
| Abhyudai Singh | 4 | 81 | 30.12 |
| Victor M. Preciado | 5 | 205 | 29.44 |