 Minimal contagious sets: Degree distributional boundsItai Arieli, Galit Ashkenazi-Golan, Ron Peretz and Yevgeny Tsodikovich Journal of Economic Theory, 2025, vol. 226, issue C Abstract: Agents in a network adopt an innovation if a certain fraction of their neighbors has already done so. We study the minimal contagious set size required for a successful innovation adoption by the entire population, and provide upper and lower bounds on it. Since detailed information about the network structure is often unavailable, we study bounds that depend only on the degree distribution of the network – a simple statistic of the network topology. Moreover, as our bounds are robust to small changes in the degree distribution, they also apply to large networks for which the degree distribution can only be approximated. Applying our bounds to growing networks shows that the minimal contagious set size is linear in the number of nodes. Consequently, for outside of knife-edge cases (such as the star-shaped network), contagion cannot be achieved without seeding a significant fraction of the population. This finding highlights the resilience of networks and demonstrates a high penetration cost in the corresponding markets. Keywords: Innovation; Diffusion; Word-of-mouth; Contagious; Attachment (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:226:y:2025:i:c:s0022053125000559 DOI: 10.1016/j.jet.2025.106009 Access Statistics for this article Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell More articles in Journal of Economic Theory from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.