Dynamics of k-core percolation

dc.creatorFarrow, C. L.
dc.creatorShukla, P.
dc.creatorDuxbury, P. M.
dc.date2008-01-23
dc.date.accessioned2026-07-07T08:56:07Z
dc.date.available2026-07-07T08:56:07Z
dc.descriptionIn 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.
dc.description4 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/0801.3644
dc.identifierhttp://arxiv.org/abs/0801.3644
dc.identifierC L Farrow et al 2007 J. Phys. A: Math. Theor. 40 F581-F587
dc.identifierdoi:10.1088/1751-8113/40/27/F02
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146495
dc.subjectStatistical Mechanics
dc.titleDynamics of k-core percolation
dc.typetext

Files

Collections