## Long ties accelerate noisy threshold-based contagions

## Long ties accelerate noisy threshold-based contagions

Dean Eckles, Elchanan Mossel, M. Amin Rahimian, Subhabrata Sen

AbstractNetwork structure can affect when and how widely new ideas, products, and behaviors are adopted. In widely-used models of biological contagion, interventions that randomly rewire edges (on average making them "longer") accelerate spread. However, there are other models relevant to social contagion, such as those motivated by myopic best-response in games with strategic complements, in which an individual's behavior is described by a threshold number of adopting neighbors above which adoption occurs (i.e., complex contagions). Recent work has argued that highly clustered, rather than random, networks facilitate spread of these complex contagions. Here we show that minor modifications to this model, which make it more realistic, reverse this result, thereby harmonizing qualitative facts about how network structure affects contagion. To model the trade-off between long and short edges we analyze the rate of spread over networks that are the union of circular lattices and random graphs on $n$ nodes. Allowing for noise in adoption decisions (i.e., adoptions below threshold) to occur with order ${n}^{-1/\theta}$ probability along at least some "short" cycle edges is enough to ensure that random rewiring accelerates the spread of a noisy threshold-$\theta$ contagion. This conclusion also holds under partial but frequent enough rewiring and when adoption decisions are reversible but infrequently so, as well as in high-dimensional lattice structures that facilitate faster-expanding contagions. Simulations illustrate the robustness of these results to several variations on this noisy best-response behavior. Hypothetical interventions that randomly rewire existing edges or add random edges (versus adding "short", triad-closing edges) in hundreds of empirical social networks reduce time to spread.

#### 2 comments

###### rahimian-amin

###### scicastboard

Questions from a non-expert physicist on the Board of ScienceCast - who works on the theory of chaos & random matrix theory:

1. Is it possible to consider a course-grained picture of the network where the dynamics can be described by a Langevin type differential equation (e.g., diffusion-type dynamics with noise)?

2. Does random matrix theory play any role in this field (e.g., is there any universal structure of eigenvalues of the matrix associated with the relevant graphs in the contagion models).

3. Finally, what is the choice of the model based on - is it a hypothesis, or it's known what class of model actually corresponds to the real world?

ScienceCast Board