Core percolation in random graphs: a critical phenomena analysis

Дата и время публикации : 2001-02-01T15:12:12Z

Авторы публикации и институты :
M. Bauer (Cea Saclay)
O. Golinelli (Cea Saclay)

Ссылка на журнал-издание: Eur. Phys. J. B 24, 339-352 (2001)
Коментарии к cтатье: 15 pages, 9 figures (color eps) [v2: published text with a new Title and addition of an appendix, a ref. and a fig.]
Первичная категория: cond-mat.stat-mech

Все категории : cond-mat.stat-mech, cond-mat.dis-nn, math.CO

Краткий обзор статьи: We study both numerically and analytically what happens to a random graph of average connectivity "alpha" 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 "alpha = 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. Key words: random graphs, leaf removal, core percolation, critical exponents, combinatorial optimization, finite size scaling, Monte-Carlo.

Category: Physics