Diffusion in Random Networks: Impact of Degree Distribution

63 Pages Posted: 21 May 2018 Last revised: 14 Jun 2019

See all articles by Vahideh Manshadi

Vahideh Manshadi

Yale School of Management

Sidhant Misra

Los Alamos National Laboratory

Scott Rodilitz

Yale School of Management

Date Written: May 6, 2018

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 due to 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.

Keywords: diffusion processes, seeding, network effects

Suggested Citation

Manshadi, Vahideh and Misra, Sidhant and Rodilitz, Scott, Diffusion in Random Networks: Impact of Degree Distribution (May 6, 2018). Available at SSRN: https://ssrn.com/abstract=3174391 or http://dx.doi.org/10.2139/ssrn.3174391

Vahideh Manshadi (Contact Author)

Yale School of Management ( email )

135 Prospect Street
P.O. Box 208200
New Haven, CT 06520-8200
United States

Sidhant Misra

Los Alamos National Laboratory ( email )

Los Alamos, NM 87545
United States

Scott Rodilitz

Yale School of Management ( email )

New Haven, CT
United States

Register to save articles to
your library

Register

Paper statistics

Downloads
77
Abstract Views
640
rank
314,178
PlumX Metrics