Dynamics of k-core percolation

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 3 figures

Keywords

Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/146495

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.3644
 http://arxiv.org/abs/0801.3644
 C L Farrow et al 2007 J. Phys. A: Math. Theor. 40 F581-F587
 doi:10.1088/1751-8113/40/27/F02

Collections

arXiv