Advances in Applied Probability

Contagions in random networks with overlapping communities

Emilie Coupechoux and Marc Lelarge

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We consider a threshold epidemic model on a clustered random graph model obtained from local transformations in an alternating branching process that approximates a bipartite graph. In other words, our epidemic model is such that an individual becomes infected as soon as the proportion of his/her infected neighbors exceeds the threshold q of the epidemic. In our random graph model, each individual can belong to several communities. The distributions for the community sizes and the number of communities an individual belongs to are arbitrary. We consider the case where the epidemic starts from a single individual, and we prove a phase transition (when the parameter q of the model varies) for the appearance of a cascade, i.e. when the epidemic can be propagated to an infinite part of the population. More precisely, we show that our epidemic is entirely described by a multi-type (and alternating) branching process, and then we apply Sevastyanov's theorem about the phase transition of multi-type Galton-Watson branching processes. In addition, we compute the entries of the mean progeny matrix corresponding to the epidemic. The phase transition for the contagion is given in terms of the largest eigenvalue of this matrix.

Article information

Source
Adv. in Appl. Probab., Volume 47, Number 4 (2015), 973-988.

Dates
First available in Project Euclid: 11 December 2015

Permanent link to this document
https://projecteuclid.org/euclid.aap/1449859796

Digital Object Identifier
doi:10.1239/aap/1449859796

Mathematical Reviews number (MathSciNet)
MR3433292

Zentralblatt MATH identifier
1362.92070

Subjects
Primary: 60C05: Combinatorial probability
Secondary: 05C80: Random graphs [See also 60B20] 91D30: Social networks

Keywords
Random graphs threshold epidemic model branching processes clustering

Citation

Coupechoux, Emilie; Lelarge, Marc. Contagions in random networks with overlapping communities. Adv. in Appl. Probab. 47 (2015), no. 4, 973--988. doi:10.1239/aap/1449859796. https://projecteuclid.org/euclid.aap/1449859796


Export citation

References

  • Athreya, K. B. and Ney, P. E. (1972). Branching Processes. Springer, New York.
  • Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. Science 286, 509–512.
  • Bender, E. A. and Canfield, E. R. (1978). The asymptotic number of labeled graphs with given degree sequences. J. Combinatorial Theory Ser. A 24, 296–307.
  • Blume, L. E. (1995). The statistical mechanics of best-response strategy revision. Games Econom. Behav. 11, 111–145.
  • Bollobás, B., Janson, S. and Riordan, O. (2011). Sparse random graphs with clustering. Random Structures Algorithms 38, 269–323.
  • Britton, T., Deijfen, M., Lagerås, A. N. and Lindholm, M. (2008). Epidemics on random graphs with tunable clustering. J. Appl. Prob. 45, 743–756.
  • Coupechoux, E. and Lelarge, M. (2011). Impact of clustering on diffusions and contagions in random networks. In Network Games, Control and Optimization (NetGCoop, 2011), IEEE, New York, pp. 112–118.
  • Coupechoux, E. and Lelarge, M. (2012). How clustering affects epidemics in random networks. Preprint. Available at http://arxiv.org/abs/1202.4974.
  • Darling, R. W. R. and Norris, J. R. (2008). Differential equation approximations for Markov chains. Prob. Surveys 5, 37–79.
  • Gan, G. and Bain, L. J. (1995). Distribution of order statistics for discrete parents with applications to censored sampling. J. Statist. Planning Infer. 44, 37–46.
  • Gleeson, J. P. (2008). Cascades on correlated and modular random networks. Phys. Rev. E 77, 046117.
  • Guillaume, J.-L. and Latapy, M. (2006). Bipartite graphs as models of complex networks. Physica A 371, 795–813.
  • Hackett, A., Melnik, S. and Gleeson, J. P. (2011). Cascades on a class of clustered random networks. Phys. Rev. E 83, 056107.
  • Harris, T. E. (1963). The Theory of Branching Processes. Springer, Berlin.
  • Janson, S. (2009). On percolation in random graphs with given vertex degrees. Electron. J. Prob. 14, 87–118.
  • Kleinberg, J. (2007). Cascading behavior in networks: algorithmic and economic issues. In Algorithmic Game Theory, Cambridge University Press, pp. 613–632.
  • Lelarge, M. (2012). Diffusion and cascading behavior in random networks. Games Econom. Behav. 75, 752–775.
  • Mode, C. J. (1971). Multitype Branching Processes – Theory and Applications. American Elsevier, New York.
  • Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6, 161–179.
  • Morris, S. (2000). Contagion. Rev. Econom. Stud. 67, 57–78.
  • Newman, M. E. J. (2002). Spread of epidemic disease on networks. Phys. Rev. E 66, 016128.
  • Newman, M. E. J. (2003). Properties of highly clustered networks. Phys. Rev. E 68, 026121.
  • Newman, M. E. J. (2003). Random graphs as models of networks. In Handbook of Graphs and Networks, Wiley-VCH, Weinheim, pp. 35–68.
  • Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45, 167–256.
  • Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
  • Sevast'yanov, B. A. (1951). The theory of branching random processes. Uspehi Matem. Nauk (N.S.) 6, 47–99.
  • Vega-Redondo, F. (2007). Complex Social Networks (Econometric Soc. Monogr. 44). Cambridge University Press.
  • Von Bahr, B. and Martin-Löf, A. (1980). Threshold limit theorems for some epidemic processes. Adv. Appl. Prob. 12, 319–349.
  • Watts, D. J. (2002). A simple model of global cascades on random networks. Proc. Nat. Acad. Sci. USA 99, 5766–5771,
  • Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of `small-world' networks. Nature 393, 440–442.