Dynamics of k-core percolation
Statistical Mechanics
2008-01-24 v1
Abstract
In many network applications nodes are stable provided they have at least k neighbors, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur after a randomly chosen k-core node is removed. Simulations of lattices in two, three and four dimensions, as well as small world networks, indicate that power-law avalanches occur in first order k-core systems, while truncated avalanches are characteristic of second order cases.
Cite
@article{arxiv.0801.3644,
title = {Dynamics of k-core percolation},
author = {C. L. Farrow and P. Shukla and P. M. Duxbury},
journal= {arXiv preprint arXiv:0801.3644},
year = {2008}
}
Comments
4 pages, 3 figures