Rapid innovation diffusion in social networks
Author(s)Kreindler, Gabriel Emanuel; Young, H. Peyton
MetadataShow full item record
Social and technological innovations often spread through social networks as people respond to what their neighbors are doing. Previous research has identified specific network structures, such as local clustering, that promote rapid diffusion. Here we derive bounds that are independent of network structure and size, such that diffusion is fast whenever the payoff gain from the innovation is sufficiently high and the agents’ responses are sufficiently noisy. We also provide a simple method for computing an upper bound on the expected time it takes for the innovation to become established in any finite network. For example, if agents choose log-linear responses to what their neighbors are doing, it takes on average less than 80 revision periods for the innovation to diffuse widely in any network, provided that the error rate is at least 5% and the payoff gain (relative to the status quo) is at least 150%. Qualitatively similar results hold for other smoothed best-response functions and populations that experience heterogeneous payoff shocks.
DepartmentMassachusetts Institute of Technology. Department of Economics
Proceedings of the National Academy of Sciences of the United States of America
National Academy of Sciences (U.S.)
Kreindler, Gabriel E., and H. Peyton Young. “Rapid Innovation Diffusion in Social Networks.” Proceedings of the National Academy of Sciences 111, no. Supplement_3 (July 14, 2014): 10881–10888.
Final published version