Weak disorder in the stochastic mean-field model of distance. II

DOI10.3150/11-BEJ402zbMath1279.60018arXiv1009.4025MaRDI QIDQ1952427

Shankar Bhamidi, Gerard Hooghiemstra, Remco van der Hofstad

Publication date: 30 May 2013

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic distributionsGumbel distributioncomplete graphfirst-passage percolation

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items (5)

Short paths for first passage percolation on the complete graph ⋮ Weak disorder asymptotics in the stochastic mean-field model of distance ⋮ 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 ⋮ Minimum-weight combinatorial structures under random cost-constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform multicommodity flow through the complete graph with random edge-capacities
• On the value of a random minimum spanning tree problem
• First-passage percolation on the square lattice
• Length of optimal path in random networks with strong disorder
• First passage percolation on random graphs with finite mean degrees
• Weak disorder asymptotics in the stochastic mean-field model of distance
• The ?(2) limit in the random assignment problem
• More Uses of Exchangeability: Representations of Complex Random Structures
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• RANDOM ELECTRICAL NETWORKS ON COMPLETE GRAPHS
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights

This page was built for publication: Weak disorder in the stochastic mean-field model of distance. II