arXiv Analytics

Sign in

arXiv:1012.2062 [math.PR]AbstractReferencesReviewsResources

Diffusion and Cascading Behavior in Random Networks

Marc Lelarge

Published 2010-12-09, updated 2011-10-19Version 4

The spread of new ideas, behaviors or technologies has been extensively studied using epidemic models. Here we consider a model of diffusion where the individuals' behavior is the result of a strategic choice. We study a simple coordination game with binary choice and give a condition for a new action to become widespread in a random network. We also analyze the possible equilibria of this game and identify conditions for the coexistence of both strategies in large connected sets. Finally we look at how can firms use social networks to promote their goals with limited information. Our results differ strongly from the one derived with epidemic models and show that connectivity plays an ambiguous role: while it allows the diffusion to spread, when the network is highly connected, the diffusion is also limited by high-degree nodes which are very stable.

Related articles: Most relevant | Search more
arXiv:1203.5974 [math.PR] (Published 2012-03-27)
The Concentration and Stability of the Community Detecting Functions on Random Networks
arXiv:1509.07033 [math.PR] (Published 2015-09-23)
Random networks with preferential growth and vertex death
arXiv:2007.05855 [math.PR] (Published 2020-07-11)
Epidemic Models as Scaling Limits of Individual Dynamics