Dynamics of k-core percolation

Details Dynamics of k-core percolation Dynamics of k-core percolation

2008-01-23

arxiv.org/abs/0801.3644v1

C L Farrow et al 2007 J. Phys. A: Math. Theor. 40 F581-F587

Physics

Condensed Matter

Statistical Mechanics

4 pages, 3 figures

Scientific paper

10.1088/1751-8113/40/27/F02

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.

Affiliated with

Also associated with

No associations

Rating

Dynamics of k-core percolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamics of k-core percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamics of k-core percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184039