A cost-effective rumor-containing strategy
arXiv:1709.02767 · doi:10.1016/j.physa.2018.02.025
Abstract
This paper addresses the issue of suppressing a rumor using the truth in a cost-effective way. First, an individual-level dynamical model capturing the rumor-truth mixed spreading processes is proposed. On this basis, the cost-effective rumor-containing problem is modeled as an optimization problem. Extensive experiments show that finding a cost-effective rumor-containing strategy boils down to enhancing the first truth-spreading rate until the cost effectiveness of the rumor-containing strategy reaches the first turning point. This finding greatly reduces the time spent for solving the optimization problem. The influences of different factors on the optimal cost effectiveness of a rumor-containing strategy are examined through computer simulations. We believe our findings help suppress rumors in a cost-effective way. To our knowledge, this is the first time the rumor-containing problem is treated this way.
References in corpus (14)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Epidemic spreading in scale-free networks
- Epidemic processes in complex networks
- Scale-free topology of e-mail networks
- Theory of Rumour Spreading in Complex Social Networks
- Epidemic dynamics in finite size scale-free networks
- Effect of the Interconnected Network Structure on the Epidemic Threshold
- Rumor propagation with heterogeneous transmission in social networks
- Adaptive Epidemic Dynamics in Networks: Thresholds and Control
- A Stochastic Model of Active Cyber Defense Dynamics
- Push- and Pull-based Epidemic Spreading in Networks: Thresholds and Deeper Insights
- Distributed interaction between computer virus and patch: A modeling study
- Assessing the risk of advanced persistent threats