Weak disorder asymptotics in the stochastic mean-field model of distance

DOI10.1214/10-AAP753zbMath1248.60012arXiv1002.4362MaRDI QIDQ2428045

Shankar Bhamidi, Remco van der Hofstad

Publication date: 20 April 2012

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic distributionbranching processesshortest pathsfirst-passage percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items

Short paths for first passage percolation on the complete graph, Geometric aspects of functional analysis. Proceedings of the Israel seminar (GAFA) 2011--2013, The winner takes it all but one, 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, Weak disorder in the stochastic mean-field model of distance. II, Shortest paths with a cost constraint: a probabilistic analysis, Successive shortest paths in complete graphs with random edge weights, Spanners in randomly weighted graphs: independent edge lengths, The Effect of Adding Randomly Weighted Edges, A Forward-Backward Single-Source Shortest Paths Algorithm, First Passage Percolation on Inhomogeneous Random Graphs, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the value of a random minimum weight Steiner tree
• Distance in random graphs with infinite mean degrees
• On the value of a random minimum spanning tree problem
• Asymptotics in the random assignment problem
• Length of optimal path in random networks with strong disorder
• The flooding time in random graphs
• Weak disorder in the stochastic mean-field model of distance. II
• First passage percolation on random graphs with finite mean degrees
• Distances in random graphs with finite mean and infinite variance degrees
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• The growth and composition of branching populations
• 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
• The Diameter of Sparse Random Graphs
• Distances in random graphs with finite variance degrees