Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs

Peer influence and interactions between agents in a population give rise to complex, nonlinear behaviors. This paper adopts the SIS (susceptible-infected-susceptible) framework from epidemiology to analytically study how network topology affects the diffusion of ideas/opinions/beliefs/innovations in social networks. We introduce the scaled SIS process, which models peer influence as neighbor-to-neighbor infections. We model the scaled SIS process as a continuous-time Markov process and derive for this process its closed form equilibrium distribution. The adjacency matrix that describes the underlying social network is explicitly reflected in this distribution. The paper shows that interesting population asymptotic behaviors occur for scenarios where the individual tendencies of each agent oppose peer influences. Specifically, we determine how the most probable configuration of agent states (i.e., the population configuration with maximum equilibrium distribution) depends on both model parameters and network topology. We show that, for certain regions of the parameter space, this and related issues reduce to standard graph questions like the maximum independent set problem.

[1]  José M. F. Moura,et al.  Accounting for topology in spreading contagion in non-complete networks , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[2]  Laurent Massoulié,et al.  Thresholds for virus spread on networks , 2006, valuetools '06.

[3]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Frank Ball,et al.  The threshold behaviour of epidemic models , 1983, Journal of Applied Probability.

[5]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[6]  Alessandro Vespignani,et al.  EPIDEMIC SPREADING IN SCALEFREE NETWORKS , 2001 .

[7]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[8]  Yinglei Song On the Independent Set and Common Subgraph Problems in Random Graphs , 2013, ArXiv.

[9]  D. Watts,et al.  Influentials, Networks, and Public Opinion Formation , 2007 .

[10]  Vasileios Pappas,et al.  Self-Organizing Processes of Collective Behavior in Computer Networks , 2022 .

[11]  Matt J. Keeling,et al.  Networks and the Epidemiology of Infectious Disease , 2010, Interdisciplinary perspectives on infectious diseases.

[12]  Matt J. Keeling,et al.  Insights from unifying modern approximations to infections on networks , 2010, Journal of The Royal Society Interface.

[13]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

[14]  Panos M. Pardalos,et al.  Finding independent sets in a graph using continuous multivariable polynomial formulations , 2001, J. Glob. Optim..

[15]  Alessandro Vespignani Modelling dynamical processes in complex socio-technical systems , 2011, Nature Physics.

[16]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[17]  José M. F. Moura,et al.  Emergent behavior in large scale networks , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  Madhav V. Marathe,et al.  Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study , 2011, SBP.

[19]  Yoshio Okamoto,et al.  Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs , 2005, WG.

[20]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.