Core percolation in random graphs: a critical phenomena analysis

被引:0
|
作者
M. Bauer
O. Golinelli
机构
[1] Service de Physique Théorique,
[2] CEA Saclay,undefined
[3] 91191 Gif-sur-Yvette,undefined
[4] France,undefined
关键词
PACS. 02.10.-v Logic, set theory, and algebra – 02.50.-r Probability theory, stochastic processes, and statistics – 64.60.Ak Renormalization-group, fractal, and percolation studies of phase transitions – 64.60.Fr Equilibrium properties near critical points, critical exponents;
D O I
暂无
中图分类号
学科分类号
摘要
We study both numerically and analytically what happens to a random graph of average connectivity α when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the core. In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the number of isolated vertices and the number of vertices and edges in the core. We show that a second order phase transition occurs at α = e = 2.718 ... : below the transition, the core is small but above the transition, it occupies a finite fraction of the initial graph. The finite size scaling properties are then studied numerically in detail in the critical region, and we propose a consistent set of critical exponents, which does not coincide with the set of standard percolation exponents for this model. We clarify several aspects in combinatorial optimization and spectral properties of the adjacency matrix of random graphs.
引用
收藏
页码:339 / 352
页数:13
相关论文
共 50 条
  • [31] General and exact approach to percolation on random graphs
    Allard, Antoine
    Hebert-Dufresne, Laurent
    Young, Jean-Gabriel
    Dube, Louis J.
    PHYSICAL REVIEW E, 2015, 92 (06)
  • [32] Unions of random walk and percolation on infinite graphs
    Okamura, Kazuki
    BRAZILIAN JOURNAL OF PROBABILITY AND STATISTICS, 2019, 33 (03) : 586 - 637
  • [33] FIRST PASSAGE PERCOLATION ON INHOMOGENEOUS RANDOM GRAPHS
    Kolossvary, Istvan
    Komjathy, Julia
    ADVANCES IN APPLIED PROBABILITY, 2015, 47 (02) : 589 - 610
  • [34] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471
  • [35] Bootstrap Percolation in Directed Inhomogeneous Random Graphs
    Detering, Nils
    Meyer-Brandis, Thilo
    Panagiotou, Konstantinos
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (03):
  • [36] PERCOLATION ON RANDOM GRAPHS WITH A FIXED DEGREE SEQUENCE
    Fountoulakis, Nikolaos
    Joos, Felix
    Perarnau, Guillem
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (01) : 1 - 46
  • [37] On percolation in random graphs with given vertex degrees
    Janson, Svante
    ELECTRONIC JOURNAL OF PROBABILITY, 2009, 14 : 87 - 118
  • [38] Site percolation on pseudo-random graphs
    Diskin, Sahar
    Krivelevich, Michael
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (02) : 406 - 441
  • [39] Site percolation on planar Φ3 random graphs
    Kownacki, J. -P.
    PHYSICAL REVIEW E, 2008, 77 (02):
  • [40] Vulnerability of networks: Fractional percolation on random graphs
    Shang, Yilun
    PHYSICAL REVIEW E, 2014, 89 (01)