Diameter of the Stochastic Mean-Field Model of Distance

DOI10.1017/S0963548317000232zbMath1379.60008arXiv1306.0208OpenAlexW2962725771MaRDI QIDQ5373829

Remco van der Hofstad, Shankar Bhamidi

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph diameterErdős-Rényi random graphinfinite random structure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items

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, Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance, Diameter and stationary distribution of random \(r\)-out digraphs, Minimum weight disk triangulations and fillings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The mean field traveling salesman and related problems
• On the value of a random minimum spanning tree problem
• Branching processes in the analysis of the heights of trees
• Asymptotics in the random assignment problem
• First passage percolation on random graphs with finite mean degrees
• The diameter of weighted random graphs
• Functional BKR inequalities, and their duals, with applications
• The ?(2) limit in the random assignment problem
• Joint Distribution of Distances in Large Random Regular Networks
• Edge flows in the complete random-lengths network
• More Uses of Exchangeability: Representations of Complex Random Structures
• Anatomy of a young giant component in the random graph
• Shortest-Weight Paths in Random Regular Graphs
• The Longest Minimum-Weight Path in a Complete Graph
• First passage percolation on locally treelike networks. I. Dense random graphs
• Note on the heights of random recursive trees and random m‐ary search trees
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• The Diameter of Sparse Random Graphs