Length of optimal path in random networks with strong disorder
From MaRDI portal
Publication:1412920
DOI10.1016/j.physa.2003.08.030zbMath1027.05084WikidataQ111628966 ScholiaQ111628966MaRDI QIDQ1412920
Lidia A. Braunstein, Reuven Cohen, Sergey V. Buldyrev, Shlomo Havlin, H. Eugene Stanley
Publication date: 30 November 2003
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2003.08.030
Related Items
Weak disorder in the stochastic mean-field model of distance. II, First passage percolation on random graphs with finite mean degrees, Universality for critical heavy-tailed network models: metric structure of maximal components, Degree distribution of shortest path trees and bias of network sampling algorithms, Weak disorder asymptotics in the stochastic mean-field model of distance, OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
Cites Work