The optimal path in an Erdős-Rényi random graph

zbMATH Open1089.90013MaRDI QIDQ3370778FDOQ3370778

Sameet Sreenivasan, Shlomo Havlin, Lidia A. Braunstein, H. Eugene Stanley, Reuven Cohen, S. V. Buldyrev

Publication date: 8 February 2006

Recommendations

• Length of optimal path in random networks with strong disorder
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Weak disorder in the stochastic mean-field model of distance. II
• Weak disorder asymptotics in the stochastic mean-field model of distance
• First passage percolation on locally treelike networks. I. Dense random graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Stochastic network models in operations research (90B15)

Cited In (7)

• Title not available (Why is that?)
• Length of optimal path in random networks with strong disorder
• The total acquisition number of the randomly weighted path
• Percolation and best-choice problem for powers of paths
• Extremal paths in inhomogenous random graphs
• Optimal Node Visitation in Stochastic Digraphs
• Successive shortest paths in complete graphs with random edge weights

This page was built for publication: The optimal path in an Erdős-Rényi random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370778)