Length of optimal path in random networks with strong disorder

DOI10.1016/j.physa.2003.08.030zbMath1027.05084OpenAlexW2085650304WikidataQ111628966 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

zbMATH Keywords

random graphsscale-free networksrandom weights

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (6)

Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS ⋮ Weak disorder asymptotics in the stochastic mean-field model of distance ⋮ Weak disorder in the stochastic mean-field model of distance. II ⋮ First passage percolation on random graphs with finite mean degrees ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• Statistical mechanics of complex networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Length of optimal path in random networks with strong disorder