Journal
PHYSICAL REVIEW LETTERS
Volume 91, Issue 16, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.91.168701
Keywords
-
Categories
Ask authors/readers for more resources
We study the optimal distance in networks, l(opt), defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For strong disorder, where the maximal weight along the path dominates the sum, we find that l(opt)similar toN(1/3) in both Erdos-Renyi (ER) and Watts-Strogatz (WS) networks. For scale-free (SF) networks, with degree distribution P(k)similar tok(-lambda), we find that l(opt) scales as N(lambda-3)/(lambda-1) for 3<4 and as N-1/3 for lambdagreater than or equal to4. Thus, for these networks, the small-world nature is destroyed. For 2<3, our numerical results suggest that l(opt) scales as ln(lambda-1)N. We also find numerically that for weak disorder l(opt)similar tolnN for both the ER and WS models as well as for SF networks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available