an 2 00 2 Core percolation in random graphs : a critical phenomena analysis

Abstract

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… (More)

9 Figures and Tables

Topics

  • Presentations referencing similar topics