IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v68y2020i6p1722-1741.html
   My bibliography  Save this article

Diffusion in Random Networks: Impact of Degree Distribution

Author

Listed:
  • Vahideh Manshadi

    (Yale School of Management, New Haven, Connecticut 06511)

  • Sidhant Misra

    (Los Alamos National Laboratory, Santa Fe, New Mexico 87545)

  • Scott Rodilitz

    (Yale School of Management, New Haven, Connecticut 06511)

Abstract

Motivated by viral marketing on social networks, we study the diffusion process of a new product on a network where each agent is connected to a random subset of others. The number of contacts (i.e., degree) varies across agents, and the firm knows the degree of each agent. Further, the firm can seed a fraction of the population and incurs a fixed cost per contact. Under any bounded degree distribution and for any target adoption proportion, we compute both the cost and the time it takes to reach the target in the limit of network size. Our characterization of the diffusion process in such a general setting is the first of its kind for a problem that is generally deemed intractable and solved using approximation methods such as mean-field. Our solution indicates that the degree distribution impacts the diffusion process even beyond its first and second moments. Using our limit results, we conduct comparative statics on degree distribution and uncover a trade-off between cost-efficiency and fast growth. Fixing the average degree, a minimum-variance degree distribution incurs the minimum cost to reach any adoption proportion. On the other hand, higher variance results in faster growth for low or moderately high target adoption proportions, but it incurs higher cost. This trade-off arises partly because of an endogenous effect of diffusion on the distribution of adopters’ neighbors: as the diffusion progresses, adopters become more likely to be connected to other adopters. This highlights the benefit of our exact analysis compared to mean-field approximation methods that rely on perfect mixing of adopters and non-adopters (i.e., there is no change in the distribution of adopters’ neighbors with the progress of diffusion). Further, we study the impact of the degree distribution on optimal seeding strategies for a given seeding budget. Somewhat surprisingly, we show that to minimize cost, it is optimal to seed low-degree agents. Even if the objective is to minimize time, for certain regimes, the optimal seeding strategy is a mixture of low- and high-degree agents.

Suggested Citation

  • Vahideh Manshadi & Sidhant Misra & Scott Rodilitz, 2020. "Diffusion in Random Networks: Impact of Degree Distribution," Operations Research, INFORMS, vol. 68(6), pages 1722-1741, November.
  • Handle: RePEc:inm:oropre:v:68:y:2020:i:6:p:1722-1741
    DOI: 10.1287/opre.2019.1945
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2019.1945
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2019.1945?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
    ---><---

    References listed on IDEAS

    as
    1. Diaz-Rainey, Ivan & Tzavara, Dionisia, 2012. "Financing the decarbonized energy system through green electricity tariffs: A diffusion model of an induced consumer environmental market," Technological Forecasting and Social Change, Elsevier, vol. 79(9), pages 1693-1704.
    2. Ross Anderson & Itai Ashlagi & David Gamarnik & Yash Kanoria, 2017. "Efficient Dynamic Barter Exchange," Operations Research, INFORMS, vol. 65(6), pages 1446-1459, December.
    3. Leduc, Matt V. & Jackson, Matthew O. & Johari, Ramesh, 2017. "Pricing and referrals in diffusion on networks," Games and Economic Behavior, Elsevier, vol. 104(C), pages 568-594.
    4. Yaniv Dover & Jacob Goldenberg & Daniel Shapira, 2012. "Network Traces on Penetration: Uncovering Degree Distribution from Adoption Data," Marketing Science, INFORMS, vol. 31(4), pages 689-712, July.
    5. Jackson, Matthew O. & Lã“Pez-Pintado, Dunia, 2013. "Diffusion and contagion in networks with heterogeneous agents and homophily," Network Science, Cambridge University Press, vol. 1(1), pages 49-67, April.
    6. Lori Beaman & Ariel BenYishay & Jeremy Magruder & Ahmed Mushfiq Mobarak, 2021. "Can Network Theory-Based Targeting Increase Technology Adoption?," American Economic Review, American Economic Association, vol. 111(6), pages 1918-1943, June.
    7. Itai Ashlagi & Maximilien Burq & Patrick Jaillet & Vahideh Manshadi, 2019. "On Matching and Thickness in Heterogeneous Dynamic Markets," Operations Research, INFORMS, vol. 67(4), pages 927-949, July.
    8. Teck-Hua Ho & Sergei Savin & Christian Terwiesch, 2002. "Managing Demand and Sales Dynamics in New Product Diffusion Under Supply Constraint," Management Science, INFORMS, vol. 48(2), pages 187-206, February.
    9. Hinz, Oliver & Skiera, Bernd & Barrot, Christian & Becker, Jan, 2011. "Seeding Strategies for Viral Marketing: An Empirical Comparison," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 56543, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    10. Matthew O. Jackson & Leeat Yariv, 2007. "Diffusion of Behavior and Equilibrium Properties in Network Games," American Economic Review, American Economic Association, vol. 97(2), pages 92-98, May.
    11. Frank M. Bass, 1969. "A New Product Growth for Model Consumer Durables," Management Science, INFORMS, vol. 15(5), pages 215-227, January.
    12. Alexandre Belloni & Changrong Deng & Saša Pekeč, 2017. "Mechanism and Network Design with Private Negative Externalities," Operations Research, INFORMS, vol. 65(3), pages 577-594, June.
    13. Kostas Bimpikis & Asuman Ozdaglar & Ercan Yildiz, 2016. "Competitive Targeted Advertising Over Networks," Operations Research, INFORMS, vol. 64(3), pages 705-720, June.
    14. Sunil Kumar & Jayashankar M. Swaminathan, 2003. "Diffusion of Innovations Under Supply Constraints," Operations Research, INFORMS, vol. 51(6), pages 866-879, December.
    15. Itay P. Fainmesser & Andrea Galeotti, 2016. "Pricing Network Effects," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 83(1), pages 165-198.
    16. Gadi Fibich & Ro'i Gibori, 2010. "Aggregate Diffusion Dynamics in Agent-Based Models with a Spatial Structure," Operations Research, INFORMS, vol. 58(5), pages 1450-1468, October.
    17. Ozan Candogan & Kostas Bimpikis & Asuman Ozdaglar, 2012. "Optimal Pricing in Networks with Externalities," Operations Research, INFORMS, vol. 60(4), pages 883-905, August.
    18. Saed Alizamir & Francis de Véricourt & Peng Sun, 2016. "Efficient Feed-In-Tariff Policies for Renewable Energy Technologies," Operations Research, INFORMS, vol. 64(1), pages 52-66, February.
    19. López-Pintado, Dunia, 2008. "Diffusion in complex social networks," Games and Economic Behavior, Elsevier, vol. 62(2), pages 573-590, March.
    20. Arthur Campbell, 2013. "Word-of-Mouth Communication and Percolation in Social Networks," American Economic Review, American Economic Association, vol. 103(6), pages 2466-2498, October.
    21. Hazhir Rahmandad & John Sterman, 2008. "Heterogeneity and Network Structure in the Dynamics of Diffusion: Comparing Agent-Based and Differential Equation Models," Management Science, INFORMS, vol. 54(5), pages 998-1014, May.
    22. Devavrat Shah & Tauhid Zaman, 2016. "Finding Rumor Sources on Random Trees," Operations Research, INFORMS, vol. 64(3), pages 736-755, June.
    23. Aral, Sinan & Muchnik, Lev & Sundararajan, Arun, 2013. "Engineering social contagions: Optimal network seeding in the presence of homophily," Network Science, Cambridge University Press, vol. 1(2), pages 125-153, August.
    24. Wenjing Shen & Izak Duenyas & Roman Kapuscinski, 2011. "New Product Diffusion Decisions Under Supply Constraints," Management Science, INFORMS, vol. 57(10), pages 1802-1810, October.
    25. Maxime C. Cohen & Pavithra Harsha, 2020. "Designing Price Incentives in a Network with Social Interactions," Manufacturing & Service Operations Management, INFORMS, vol. 22(2), pages 292-309, March.
    26. Ilan Lobel & Evan Sadler & Lav R. Varshney, 2017. "Customer Referral Incentives and Social Media," Management Science, INFORMS, vol. 63(10), pages 3514-3529, October.
    27. Wenjing Shen & Izak Duenyas & Roman Kapuscinski, 2014. "Optimal Pricing, Production, and Inventory for New Product Diffusion Under Supply Constraints," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 28-45, February.
    28. Nur Sunar & John R. Birge & Sinit Vitavasiri, 2019. "Optimal Dynamic Product Development and Launch for a Network of Customers," Operations Research, INFORMS, vol. 67(3), pages 770-790, May.
    29. Matthew O. Jackson & Brian W. Rogers, 2007. "Meeting Strangers and Friends of Friends: How Random Are Social Networks?," American Economic Review, American Economic Association, vol. 97(3), pages 890-915, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Feng Zhu & Xinxin Li & Ehsan Valavi & Marco Iansiti, 2021. "Network Interconnectivity and Entry into Platform Markets," Information Systems Research, INFORMS, vol. 32(3), pages 1009-1024, September.
    2. Mohammad Ghaderi, 2020. "Public Health Interventions in the Face of Pandemics: Network Structure, Social Distancing, and Heterogeneity," Working Papers 1193, Barcelona School of Economics.
    3. Øverby, Harald & Audestad, Jan A. & Szalkowski, Gabriel Andy, 2023. "Compartmental market models in the digital economy—extension of the Bass model to complex economic systems," Telecommunications Policy, Elsevier, vol. 47(1).
    4. Mohamed Mostagir & James Siderius, 2023. "Social Inequality and the Spread of Misinformation," Management Science, INFORMS, vol. 69(2), pages 968-995, February.
    5. Ghaderi, Mohammad, 2022. "Public health interventions in the face of pandemics: Network structure, social distancing, and heterogeneity," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1016-1031.
    6. Jiao, Qian & Xu, Jin, 2020. "Competition for networked agents in the lottery Blotto game," Economics Letters, Elsevier, vol. 197(C).
    7. Mohammad Ghaderi, 2020. "Public health interventions in the face of pandemics: network structure, social distancing, and heterogeneity," Economics Working Papers 1732, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Daron Acemoglu & Ali Makhdoumi & Azarakhsh Malekian & Asuman Ozdaglar, 2020. "Testing, Voluntary Social Distancing and the Spread of an Infection," NBER Working Papers 27483, National Bureau of Economic Research, Inc.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Michel Grabisch & Agnieszka Rusinowska & Xavier Venel, 2019. "Diffusion in countably infinite networks," Documents de travail du Centre d'Economie de la Sorbonne 19017, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Antonio Jiménez-Martínez, 2019. "Discrimination through versioning with advertising in social networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(3), pages 525-564, April.
    3. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    4. Arthur Campbell & C. Matthew Leister & Yves Zenou, 2020. "Word‐of‐mouth communication and search," RAND Journal of Economics, RAND Corporation, vol. 51(3), pages 676-712, September.
    5. Yang Zhang & Ying-Ju Chen, 2020. "Optimal Nonlinear Pricing in Social Networks Under Asymmetric Network Information," Operations Research, INFORMS, vol. 68(3), pages 818-833, May.
    6. Leduc, Matt V. & Jackson, Matthew O. & Johari, Ramesh, 2017. "Pricing and referrals in diffusion on networks," Games and Economic Behavior, Elsevier, vol. 104(C), pages 568-594.
    7. Hong, Zhaofu & Li, Mengfan & Han, Xiaoya & He, Xuhuai, 2020. "Innovative green product diffusion through word of mouth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    8. Bin Hu & Zhankun Sun, 2022. "Managing Self-Replicating Innovative Goods," Management Science, INFORMS, vol. 68(1), pages 399-419, January.
    9. Eryn Juan He & Joel Goh, 2022. "Profit or Growth? Dynamic Order Allocation in a Hybrid Workforce," Management Science, INFORMS, vol. 68(8), pages 5891-5906, August.
    10. Belhaj, Mohamed & Deroïan, Frédéric, 2021. "The value of network information: Assortative mixing makes the difference," Games and Economic Behavior, Elsevier, vol. 126(C), pages 428-442.
    11. A. Negahban & J.S. Smith, 2016. "The effect of supply and demand uncertainties on the optimal production and sales plans for new products," International Journal of Production Research, Taylor & Francis Journals, vol. 54(13), pages 3852-3869, July.
    12. Daniel C. Opolot & Théophile T. Azomahou, 2021. "Strategic diffusion in networks through contagion," Journal of Evolutionary Economics, Springer, vol. 31(3), pages 995-1027, July.
    13. Yunke Mai & Bin Hu, 2023. "Optimizing Free-to-Play Multiplayer Games with Premium Subscription," Management Science, INFORMS, vol. 69(6), pages 3437-3456, June.
    14. Shin, Euncheol, 2017. "Monopoly pricing and diffusion of social network goods," Games and Economic Behavior, Elsevier, vol. 102(C), pages 162-178.
    15. Matthew O. Jackson & Brian W. Rogers & Yves Zenou, 2016. "Networks: An Economic Perspective," Papers 1608.07901, arXiv.org.
    16. Jadbabaie, Ali & Kakhbod, Ali, 2019. "Optimal contracting in networks," Journal of Economic Theory, Elsevier, vol. 183(C), pages 1094-1153.
    17. Gong, Qingbin & Diao, Xundi, 2023. "The impacts of investor network and herd behavior on market stability: Social learning, network structure, and heterogeneity," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1388-1398.
    18. Li, Jian & Zhou, Junjie & Chen, Ying-Ju, 2022. "The limit of targeting in networks," Journal of Economic Theory, Elsevier, vol. 201(C).
    19. Abedi, Vahideh Sadat, 2019. "Compartmental diffusion modeling: Describing customer heterogeneity & communication network to support decisions for new product introductions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    20. Amini, Mehdi & Wakolbinger, Tina & Racer, Michael & Nejad, Mohammad G., 2012. "Alternative supply chain production–sales policies for new product diffusion: An agent-based modeling and simulation approach," European Journal of Operational Research, Elsevier, vol. 216(2), pages 301-311.

    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:inm:oropre:v:68:y:2020:i:6:p:1722-1741. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.