2 papers
cond-mat.dis-nn2005
Scaling of optimal-path-lengths distribution in complex networks
Tomer Kalisk, Lidia A. Braunstein, Sergey V. Buldyrev +2
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link we associate a weight $τ_i = \ex…
cond-mat.soft2003★ 189 cited
Optimal Paths in Disordered Complex Networks
Lidia A. Braunstein, Sergey V. Buldyrev, Reuven Cohen +2
We study the optimal distance in networks, , defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introdu…