Containing misinformation spreading in temporal social networks

April 24, 2019 Β· Declared Dead Β· πŸ› Chaos

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wei Wang, Yuanhui Ma, Tao Wu, Yang Dai, Xingshu Chen, Lidia A. Braunstein arXiv ID 1904.10801 Category physics.soc-ph Cross-listed cs.SI Citations 22 Venue Chaos Last Checked 3 months ago
Abstract
Many researchers from a variety of fields including computer science, network science and mathematics have focused on how to contain the outbreaks of Internet misinformation that threaten social systems and undermine societal health. Most research on this topic treats the connections among individuals as static, but these connections change in time, and thus social networks are also temporal networks. Currently there is no theoretical approach to the problem of containing misinformation outbreaks in temporal networks. We thus propose a misinformation spreading model for temporal networks and describe it using a new theoretical approach. We propose a heuristic-containing (HC) strategy based on optimizing final outbreak size that outperforms simplified strategies such as those that are random-containing (RC) and targeted-containing (TC). We verify the effectiveness of our HC strategy on both artificial and real-world networks by performing extensive numerical simulations and theoretical analyses. We find that the HC strategy greatly increases the outbreak threshold and decreases the final outbreak threshold.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted