Limited Path Percolation in Complex Networks

@article{citeulike:2751728, abstract = {We study the stability of network communication after removal of a fraction q=1-p of links under the assumption that communication is effective only if the shortest path between nodes i and j after removal is shorter than a[script-l]ij(a>=1) where [script-l]ij is the shortest path before removal. For a large class of networks, we find analytically and numerically a new percolation transition at p-tildec=(kappa0-1)(1-a)/a, where kappa0[equivalent]<k2>/<k> and k is the node degree. Above p-tildec, order N nodes can communicate within the limited path length a[script-l]ij, while below p-tildec, Ndelta (delta<1) nodes can communicate. We expect our results to influence network design, routing algorithms, and immunization strategies, where short paths are most relevant.}, author = {Eduardo}, citeulike-article-id = {2751728}, keywords = {2007, cool, focus}, posted-at = {2008-05-04 00:44:37}, priority = {2}, title = {Limited Path Percolation in Complex Networks} }

TY - JOUR ID - citeulike:2751728 L3 - citeulike-article-id:2751728 TI - Limited Path Percolation in Complex Networks N2 - We study the stability of network communication after removal of a fraction q=1-p of links under the assumption that communication is effective only if the shortest path between nodes i and j after removal is shorter than a[script-l]ij(a>=1) where [script-l]ij is the shortest path before removal. For a large class of networks, we find analytically and numerically a new percolation transition at p-tildec=(kappa0-1)(1-a)/a, where kappa0[equivalent]<k2>/<k> and k is the node degree. Above p-tildec, order N nodes can communicate within the limited path length a[script-l]ij, while below p-tildec, Ndelta (delta<1) nodes can communicate. We expect our results to influence network design, routing algorithms, and immunization strategies, where short paths are most relevant. KW - 2007 KW - cool KW - focus AU - Eduardo ER -