Information Cascades in Feed-based Networks of Users with Limited Attention

August 27, 2015 Β· Declared Dead Β· πŸ› IEEE Transactions on Network Science and Engineering

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sameet Sreenivasan, Kevin S. Chan, Ananthram Swami, Gyorgy Korniss, Boleslaw Szymanski arXiv ID 1508.06950 Category physics.soc-ph Cross-listed cs.SI Citations 23 Venue IEEE Transactions on Network Science and Engineering Last Checked 3 months ago
Abstract
We build a model of information cascades on feed-based networks, taking into account the finite attention span of users, message generation rates and message forwarding rates. Using this model, we study through simulations, the effect of the extent of user attention on the probability that the cascade becomes viral. In analogy with a branching process, we estimate the branching factor associated with the cascade process for different attention spans and different forwarding probabilities, and demonstrate that beyond a certain attention span, critical forwarding probabilities exist that constitute a threshold after which cascades can become viral. The critical forwarding probabilities have an inverse relationship with the attention span. Next, we develop a semi-analytical approach for our model, that allows us determine the branching factor for given values of message generation rates, message forwarding rates and attention spans. The branching factors obtained using this analytical approach show good agreement with those obtained through simulations. Finally, we analyze an event specific dataset obtained from Twitter, and show that estimated branching factors correlate well with the cascade size distributions associated with distinct hashtags.
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