k-core organization of complex networks

Details k-core organization of complex networks k-core organization of complex networks

2005-09-05

arxiv.org/abs/cond-mat/0509102v3

Phys. Rev. Lett. 96, 040601 (2006)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 3 figures

Scientific paper

10.1103/PhysRevLett.96.040601

We analytically describe the architecture of randomly damaged uncorrelated networks as a set of successively enclosed substructures -- k-cores. The k-core is the largest subgraph where vertices have at least k interconnections. We find the structure of k-cores, their sizes, and their birth points -- the bootstrap percolation thresholds. We show that in networks with a finite mean number z_2 of the second-nearest neighbors, the emergence of a k-core is a hybrid phase transition. In contrast, if z_2 diverges, the networks contain an infinite sequence of k-cores which are ultra-robust against random damage.

Affiliated with

Also associated with

No associations

Rating

k-core organization of complex networks 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 k-core organization of complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-core organization of complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378977