Diffusion and cascading behavior in random networks

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.

[1]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Marc Lelarge,et al.  Diffusion of Innovations on Random Networks: Understanding the Chasm , 2008, WINE.

[4]  Prasanna Gai,et al.  Contagion in financial networks , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[5]  Jure Leskovec,et al.  Meme-tracking and the dynamics of the news cycle , 2009, KDD.

[6]  Svante Janson,et al.  A simple solution to the k-core problem , 2007, Random Struct. Algorithms.

[7]  David P. Myatt,et al.  Innovation Diffusion in Heterogeneous Populations: Contagion, Social Influence, and Social Learning , 2009 .

[8]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[9]  J. Kleinberg.  Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[10]  L. Blume.  The Statistical Mechanics of Strategic Interaction , 1993 .

[11]  Svante Janson,et al.  On percolation in random graphs with given vertex degrees , 2008, 0804.1656.

[12]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[13]  Emilie Coupechoux,et al.  How Clustering Affects Epidemics in Random Networks , 2012, Advances in Applied Probability.

[14]  S. Battiston,et al.  Liaisons Dangereuses: Increasing Connectivity, Risk Sharing, and Systemic Risk , 2009 .

[15]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[16]  Éva Tardos,et al.  Network games , 2004, STOC '04.

[17]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[18]  Fernando Vega-Redondo,et al.  Complex Social Networks: Searching in Social Networks , 2007 .

[19]  Emilie Coupechoux,et al.  Impact of clustering on diffusions and contagions in random networks , 2011, International Conference on NETwork Games, Control and Optimization (NetGCooP 2011).

[20]  H. Young,et al.  The Evolution of Conventions , 1993 .

[21]  Éva Tardos,et al.  Which Networks are Least Susceptible to Cascading Failures? , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[22]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Dunia López-Pintado,et al.  Diffusion in complex social networks , 2008, Games Econ. Behav..

[24]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[25]  Glenn Ellison,et al.  Word-of-Mouth Communication and Social Learning , 1995 .

[26]  Yidong Sun.  A Simple Bijection between Binary Trees and Colored Ternary Trees , 2010, Electron. J. Comb..

[27]  L. Blume.  The Statistical Mechanics of Best-Response Strategy Revision , 1995 .

[28]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[29]  S. Janson,et al.  A simple solution to the k-core problem , 2007 .

[30]  N. Ling.  The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[31]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[32]  Hamed Amini,et al.  Bootstrap Percolation and Diffusion in Random Graphs with Given Vertex Degrees , 2010, Electron. J. Comb..

[33]  Christos Faloutsos,et al.  Modeling Blog Dynamics , 2009, ICWSM.

[34]  John Doyle,et al.  Complexity and robustness , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[35]  A. Galeotti,et al.  Influencing the influencers: a theory of strategic diffusion , 2009 .

[36]  József Balogh,et al.  Bootstrap percolation on the random regular graph , 2007, Random Struct. Algorithms.

[37]  Andrea Montanari,et al.  The spread of innovations in social networks , 2010, Proceedings of the National Academy of Sciences.

[38]  Marc Lelarge,et al.  Network externalities and the deployment of security features and protocols in the internet , 2008, SIGMETRICS '08.

[39]  Svante Janson.  The Probability That a Random Multigraph is Simple , 2009, Comb. Probab. Comput..

[40]  R. Rob,et al.  Learning, Mutation, and Long Run Equilibria in Games , 1993 .

[41]  M. Jackson,et al.  Diffusion of Behavior and Equilibrium Properties in Network Games , 2007 .

[42]  Glenn Ellison.  Learning, Local Interaction, and Coordination , 1993 .

[43]  Svante Janson,et al.  A new approach to the giant component problem , 2009 .

[44]  Marc Lelarge,et al.  Efficient control of epidemics over random networks , 2009, SIGMETRICS '09.

[45]  The Spread of Innovations Through Social Learning , 2005 .

[46]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[47]  Marc Lelarge,et al.  Diffusion and cascading behavior in random networks , 2010, PERV.