Sat, 26 Jul 2008 06:07:01 BST CiteULike: dchen's library [897 articles] http://www.citeulike.org/user/dchen/article/2751728 CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/dchen/article/2751728 <i></i><br /><br />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. Limited Path Percolation in Complex Networks Eduardo 2008-05-03T23:43:59-00:00 2007 cool focus