CONTAGIONS IN RANDOM NETWORKS WITH OVERLAPPING COMMUNITIES

被引:5
|
作者
Coupechoux, Emilie [1 ,2 ]
Lelarge, Marc [2 ]
机构
[1] Univ Nice Sophia Antipolis, Lab I3S, CS 40121, F-06903 Sophia Antipolis, France
[2] INRIA ENS, F-75214 Paris 13, France
关键词
Random graphs; threshold epidemic model; branching processes; clustering; RANDOM GRAPHS;
D O I
10.1017/S0001867800048977
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
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.
引用
收藏
页码:973 / 988
页数:16
相关论文
共 50 条
  • [41] Principles of statistical mechanics of uncorrelated random networks
    Dorogovtsev, SN
    Mendes, JFF
    Samukhin, A
    NUCLEAR PHYSICS B, 2003, 666 (03) : 396 - 416
  • [42] Distributed Linear Equations Over Random Networks
    Yi, Peng
    Lei, Jinlong
    Chen, Jie
    Hong, Yiguang
    Shi, Guodong
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (04) : 2607 - 2614
  • [43] Resolving Braess's Paradox in Random Networks
    Fotakis, Dimitris
    Kaporis, Alexis C.
    Lianeas, Thanasis
    Spirakis, Paul G.
    ALGORITHMICA, 2017, 78 (03) : 788 - 818
  • [44] A motif building process for simulating random networks
    Polansky, Alan M.
    Pramanik, Paramahansa
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2021, 162
  • [45] Reaching a Consensus on Random Networks: The Power of Few
    Tran, Linh
    Vu, Van
    THEORY OF COMPUTING, 2023, 19 : 1 - 21
  • [46] Finite size corrections to random Boolean networks
    Leone, Michele
    Pagnani, Andrea
    Parisi, Giorgio
    Zagordi, Osvaldo
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2006,
  • [47] Resolving Braess’s Paradox in Random Networks
    Dimitris Fotakis
    Alexis C. Kaporis
    Thanasis Lianeas
    Paul G. Spirakis
    Algorithmica, 2017, 78 : 788 - 818
  • [48] Generating Random Networks Without Short Cycles
    Bayati, Mohsen
    Montanari, Andrea
    Saberi, Amin
    OPERATIONS RESEARCH, 2018, 66 (05) : 1227 - 1246
  • [49] Modeling message propagation in random graph networks
    Wu, Bin
    Kshemkalyani, Ajay D.
    COMPUTER COMMUNICATIONS, 2008, 31 (17) : 4138 - 4148
  • [50] Modelling complex networks by random hierarchical graphs
    Wrobel, M.
    CONDENSED MATTER PHYSICS, 2008, 11 (02) : 341 - 346