A model of spreading of sudden events on social networks
October 06, 2017 Β· Declared Dead Β· π Chaos
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Jiao Wu, Muhua Zheng, Zi-Ke Zhang, Wei Wang, Changgui Gu, Zonghua Liu
arXiv ID
1710.02274
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
22
Venue
Chaos
Last Checked
3 months ago
Abstract
Information spreading has been studied for decades, but its underlying mechanism is still under debate, especially for those ones spreading extremely fast through Internet. By focusing on the information spreading data of six typical events on Sina Weibo, we surprisingly find that the spreading of modern information shows some new features, i.e. either extremely fast or slow, depending on the individual events. To understand its mechanism, we present a Susceptible-Accepted-Recovered (SAR) model with both information sensitivity and social reinforcement. Numerical simulations show that the model can reproduce the main spreading patterns of the six typical events. By this model we further reveal that the spreading can be speeded up by increasing either the strength of information sensitivity or social reinforcement. Depending on the transmission probability and information sensitivity, the final accepted size can change from continuous to discontinuous transition when the strength of the social reinforcement is large. Moreover, an edge-based compartmental theory is presented to explain the numerical results. These findings may be of significance on the control of information spreading in modern society.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
π
π
The Cartographer
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted