Are Percolation Transitions always Sharpened by Making Networks Interdependent?

Details Are Percolation Transitions always Sharpened by Making Networks Interdependent? Are Percolation Transitions always Sharpened by Making Networks Interdependent?

2011-08-18

arxiv.org/abs/1108.3863v3

Physics

Data Analysis, Statistics and Probability

4 pages, including 6 figures; version 3 includes supplementary material (including 9 figures)

Scientific paper

We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a percolation transition that has been claimed to be more abrupt than that for uncoupled networks. Indeed, it was found to be discontinuous in all cases studied. Using an efficient new algorithm we verify that the transition is discontinuous for coupled Erdos-Renyi networks, but find it to be continuous for fully interdependent diluted lattices. In 2 and 3 dimension, the order parameter exponent $\beta$ is larger than in ordinary percolation, showing that the transition is less sharp, i.e. further from discontinuity, than for isolated networks. Possible consequences for spatially embedded networks are discussed.

Affiliated with

Also associated with

No associations

Rating

Are Percolation Transitions always Sharpened by Making Networks Interdependent? 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 Are Percolation Transitions always Sharpened by Making Networks Interdependent?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are Percolation Transitions always Sharpened by Making Networks Interdependent? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-107694