IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v226y2025ics0022053125000559.html
   My bibliography  Save this article

Minimal contagious sets: Degree distributional bounds

Author

Listed:
  • Arieli, Itai
  • Ashkenazi-Golan, Galit
  • Peretz, Ron
  • Tsodikovich, Yevgeny

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.

Suggested Citation

  • Arieli, Itai & Ashkenazi-Golan, Galit & Peretz, Ron & Tsodikovich, Yevgeny, 2025. "Minimal contagious sets: Degree distributional bounds," Journal of Economic Theory, Elsevier, vol. 226(C).
    • Handle: RePEc:eee:jetheo:v:226:y:2025:i:c:s0022053125000559
    DOI: 10.1016/j.jet.2025.106009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022053125000559
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jet.2025.106009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:226:y:2025:i:c:s0022053125000559. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.