The spread of innovations in social networks
- 12 November 2010
- journal article
- Published by Proceedings of the National Academy of Sciences in Proceedings of the National Academy of Sciences of the United States of America
- Vol. 107 (47), 20196-20201
- https://doi.org/10.1073/pnas.1004098107
Abstract
Which network structures favor the rapid spread of new ideas, behaviors, or technologies? This question has been studied extensively using epidemic models. Here we consider a complementary point of view and consider scenarios where the individuals' behavior is the result of a strategic choice among competing alternatives. In particular, we study models that are based on the dynamics of coordination games. Classical results in game theory studying this model provide a simple condition for a new action or innovation to become widespread in the network. The present paper characterizes the rate of convergence as a function of the structure of the interaction network. The resulting predictions differ strongly from the ones provided by epidemic models. In particular, it appears that innovation spreads much more slowly on well-connected network structures dominated by long-range links than in low-dimensional ones dominated, for example, by geographic proximity.Keywords
This publication has 16 references indexed in Scilit:
- Glauber dynamics on trees and hyperbolic graphsProbability Theory and Related Fields, 2004
- Conductance and congestion in power law graphsACM SIGMETRICS Performance Evaluation Review, 2003
- Quantal Response Equilibria for Normal Form GamesGames and Economic Behavior, 1995
- Learning, Local Interaction, and CoordinationEconometrica, 1993
- Comparison Theorems for Reversible Markov ChainsThe Annals of Applied Probability, 1993
- The Evolution of ConventionsEconometrica, 1993
- Learning, Mutation, and Long Run Equilibria in GamesEconometrica, 1993
- Behavior of droplets for a class of Glauber dynamics at very low temperatureProbability Theory and Related Fields, 1992
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- On the principal eigenvalue of second-order elliptic differential operatorsCommunications on Pure and Applied Mathematics, 1976