Short paths for first passage percolation on the complete graph

DOI10.1007/s10955-013-0743-7zbMath1314.82021arXiv1211.4569OpenAlexW2038033449MaRDI QIDQ359585

Maren Eckhoff, Jesse Goodman, Remco van der Hofstad, Francesca R. Nardi

Publication date: 12 August 2013

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.4569

zbMATH Keywords

universalitycomplete graphfirst passage percolationhopcountweak disorderfirst and second moment methodpath counting

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Percolation (82B43)

Related Items (8)

Short paths for first passage percolation on the complete graph ⋮ Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics ⋮ Long paths in first passage percolation on the complete graph II. Global branching dynamics ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ Last passage percolation on the complete graph ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Successive shortest paths in complete graphs with random edge weights ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short paths for first passage percolation on the complete graph
• Weak disorder in the stochastic mean-field model of distance. II
• Universality for first passage percolation on sparse random graphs
• Weak disorder asymptotics in the stochastic mean-field model of distance
• Distances in random graphs with finite mean and infinite variance degrees
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• Random Graphs and Complex Networks
• First Passage Percolation on the Erdős–Rényi Random Graph
• First passage percolation on locally treelike networks. I. Dense random graphs
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Distances in random graphs with finite variance degrees

This page was built for publication: Short paths for first passage percolation on the complete graph