Limited path percolation in complex networks

Details Limited path percolation in complex networks Limited path percolation in complex networks

2007-02-28

arxiv.org/abs/cond-mat/0702691v1

Phys. Rev. Lett. 99, 188701 (2007)

Physics

Condensed Matter

Statistical Mechanics

11 pages, 3 figures, 1 table

Scientific paper

10.1103/PhysRevLett.99.188701

We study the stability of network communication after removal of $q=1-p$ links under the assumption that communication is effective only if the shortest path between nodes $i$ and $j$ after removal is shorter than $a\ell_{ij} (a\geq1)$ where $\ell_{ij}$ is the shortest path before removal. For a large class of networks, we find a new percolation transition at $\tilde{p}_c=(\kappa_o-1)^{(1-a)/a}$, where $\kappa_o\equiv < k^2>/< k>$ and $k$ is the node degree. Below $\tilde{p}_c$, only a fraction $N^{\delta}$ of the network nodes can communicate, where $\delta\equiv a(1-|\log p|/\log{(\kappa_o-1)}) < 1$, while above $\tilde{p}_c$, order $N$ nodes can communicate within the limited path length $a\ell_{ij}$. Our analytical results are supported by simulations on Erd\H{o}s-R\'{e}nyi and scale-free network models. We expect our results to influence the design of networks, routing algorithms, and immunization strategies, where short paths are most relevant.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524546