TY - GEN

T1 - On the guarantee of containment probability in influence minimization

AU - Chang, Chien Wei

AU - Yeh, Mi Yen

AU - Chuang, Kun Ta

N1 - Funding Information:
This paper was supported in part by Ministry of Science and Technology, R.O.C., under Contract 104-2221-E-006-050, 105-2634-B-006-001, and 103-2221-E-001-006-MY2

PY - 2016/11/21

Y1 - 2016/11/21

N2 - We in this paper explore a novel model of influence minimization for the need to effectively prevent the outbreak of epidemic-prone spread on networks. The current network-blocking models usually report the expected number of infected nodes under the limited number of cutting edges. However, to control the epidemic-prone spread such as dengue fever, epidemiologists tend to deploy a cost-effective intervention with low outbreak risk, but the outbreak risk cannot be estimated based on the expectation of infected count. We in this paper explore the first solution to estimate the probability that can successfully bound the infected count below the out-of-control threshold, which can be logically mapped to the outbreak risk and can facilitate the authority to adaptively adjust the intervention cost for the need of risk control. We elaborate upon the proposed MCP (standing for Maximization of Containment Probability) problem and show that it is a NP-hard challenge without the submodular property. We further devise an effective measurement of sufficient number of Monte Carlo iterations based on the relative error of Monte Carol integration. The experimental results show that our proposed algorithm with small iterations can deliver the qualified guarantee of containment probability, demonstrating its feasibility for real applications.

AB - We in this paper explore a novel model of influence minimization for the need to effectively prevent the outbreak of epidemic-prone spread on networks. The current network-blocking models usually report the expected number of infected nodes under the limited number of cutting edges. However, to control the epidemic-prone spread such as dengue fever, epidemiologists tend to deploy a cost-effective intervention with low outbreak risk, but the outbreak risk cannot be estimated based on the expectation of infected count. We in this paper explore the first solution to estimate the probability that can successfully bound the infected count below the out-of-control threshold, which can be logically mapped to the outbreak risk and can facilitate the authority to adaptively adjust the intervention cost for the need of risk control. We elaborate upon the proposed MCP (standing for Maximization of Containment Probability) problem and show that it is a NP-hard challenge without the submodular property. We further devise an effective measurement of sufficient number of Monte Carlo iterations based on the relative error of Monte Carol integration. The experimental results show that our proposed algorithm with small iterations can deliver the qualified guarantee of containment probability, demonstrating its feasibility for real applications.

UR - http://www.scopus.com/inward/record.url?scp=85006791418&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85006791418&partnerID=8YFLogxK

U2 - 10.1109/ASONAM.2016.7752240

DO - 10.1109/ASONAM.2016.7752240

M3 - Conference contribution

AN - SCOPUS:85006791418

T3 - Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

SP - 231

EP - 238

BT - Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

A2 - Kumar, Ravi

A2 - Caverlee, James

A2 - Tong, Hanghang

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

Y2 - 18 August 2016 through 21 August 2016

ER -