OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS

DOI10.1142/S0218127407018361zbMath1141.05336arXivcond-mat/0606338OpenAlexW2156119272WikidataQ111628949 ScholiaQ111628949MaRDI QIDQ3511034

Eduardo López, Reuven Cohen, Sameet Sreenivasan, Tomer Kalisky, Lidia A. Braunstein, Zhenhua Wu, Yi-Ping Chen, Sergey V. Buldyrev, H. Eugene Stanley, Shlomo Havlin

Publication date: 4 July 2008

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0606338

zbMATH Keywords

optimizationpercolationminimum spanning treescale-free

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Equilibrium statistical mechanics (82B99)

Related Items

Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ A probabilistic approach to the leader problem in random graphs ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Weak disorder in the stochastic mean-field model of distance. II ⋮ Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Extracting the sovereigns' CDS market hierarchy: a correlation-filtering approach ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Spatial Homogeneity Pursuit of Regression Coefficients for Large Datasets

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Geometry of minimum spanning trees on scale-free networks
• Length of optimal path in random networks with strong disorder
• Complex networks: structure and dynamics
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• Statistical mechanics of complex networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence