2007
DOI: 10.2202/1935-1704.1341
|View full text |Cite
|
Sign up to set email alerts
|

Relating Network Structure to Diffusion Properties through Stochastic Dominance

Abstract: We examine the spread of a disease or behavior through a social network. In particular, we analyze how infection rates depend on the distribution of degrees (numbers of links) among the nodes in the network. We introduce new techniques using first- and second order stochastic dominance relationships of the degree distribution in order to compare infection rates across different social networks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

8
111
0
1

Year Published

2008
2008
2019
2019

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 102 publications
(120 citation statements)
references
References 6 publications
8
111
0
1
Order By: Relevance
“…Finally, our paper also connects with the literature on social in ‡uence, social learning and contagion (see, e.g., Jackson and Rogers (2007b), Jackson and Yariv (2007), Lopez-Pintado (2008), Young (2009). The di¤erent approaches used in these studies to analyzing di¤usion generally assume a connectivity distribution of the population, and/or a payo¤ function whose arguments include an individual's and her neighbors' choice of a certain behavior, and often rely on mean-…eld approximation theory to identify equilibria.…”
Section: Some Applicationssupporting
confidence: 63%
“…Finally, our paper also connects with the literature on social in ‡uence, social learning and contagion (see, e.g., Jackson and Rogers (2007b), Jackson and Yariv (2007), Lopez-Pintado (2008), Young (2009). The di¤erent approaches used in these studies to analyzing di¤usion generally assume a connectivity distribution of the population, and/or a payo¤ function whose arguments include an individual's and her neighbors' choice of a certain behavior, and often rely on mean-…eld approximation theory to identify equilibria.…”
Section: Some Applicationssupporting
confidence: 63%
“…In contrast, most previous agent-based studies computed the aggregate diffusion dynamics only numerically. The studies that did calculate the aggregate dynamics analytically either employed some type of a mean-field approximation, or obtained analytical results for steady-state solutions, such as the fraction of the population that will become infected by an epidemic at equilibria (López-Pintado 2008, Jackson and Rogers 2007, Jackson 2006, Vega-Redondo 2006, Pastor-Satorrás and Vespignani 2001. Note that in all the agent-based models considered in this study, once an individual becomes an adopter, he remains so at all later times.…”
Section: Introductionmentioning
confidence: 99%
“…We generate two di¤erent random networks in terms of their connectivity distributions: 7 (i) a scale-free network with connectivity distribution P (k) / k 2:5 for k 3 and P SF (k) = 0 otherwise (where / means, equal up to a multiplicative constant) (ii) an exponential network P (k) / e k 6 for k 3 and P E (k) = 0 otherwise. 8 Each of these two networks have a total of 1000 nodes and an average connectivity of approximately 9, however, scale-free networks have signi…cantly larger variance than exponential networks. The in- 7 The main reason why the dynamics on random networks might reproduce the mean…eld approximations is that in a random network the characteristics of any given node is una¤ected by structural correlations.…”
Section: Simulationsmentioning
confidence: 99%