Dynamics of k-core percolation in a random graph
Statistical Mechanics
2009-11-13 v2
Abstract
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core percolation point is exactly given as the saddle-node bifurcation point in a dynamical system. We then determine all the exponents for the divergence based on a universal description of fluctuations near the saddle-node bifurcation.
Cite
@article{arxiv.0808.0766,
title = {Dynamics of k-core percolation in a random graph},
author = {Mami Iwata and Shin-ichi Sasa},
journal= {arXiv preprint arXiv:0808.0766},
year = {2009}
}
Comments
16 pages, 4 figures