The diameter of weighted random graphs

DOI10.1214/14-AAP1034zbMath1351.60009arXiv1112.6330OpenAlexW2053943172MaRDI QIDQ2346086

Marc Lelarge, Hamed Amini

Publication date: 29 May 2015

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

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

zbMATH Keywords

random graphsfirst-passage percolationweighted diameter

Mathematics Subject Classification ID

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

Related Items (6)

Diameter of the Stochastic Mean-Field Model of Distance ⋮ Flooding and diameter in general weighted random graphs ⋮ The duration of a supercritical \(\mathit{SIR}\) epidemic on a configuration model ⋮ First passage percolation on sparse random graphs with boundary weights ⋮ Joint Distribution of Distances in Large Random Regular Networks ⋮ First Passage Percolation on Inhomogeneous Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diffusion and cascading behavior in random networks
• Asymptotic normality of the \(k\)-core in random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• The diameter of random regular graphs
• First passage percolation on random graphs with finite mean degrees
• First-passage percolation, network flows and electrical resistances
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• First Passage Percolation on the Erdős–Rényi Random Graph
• Shortest-Weight Paths in Random Regular Graphs
• A simple solution to the k‐core problem
• Stochastic ordering of classical discrete distributions
• A new approach to the giant component problem
• First passage percolation on locally treelike networks. I. Dense random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• First passage percolation and a model for competing spatial growth
• The Average Distance in a Random Graph with Given Expected Degrees
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Upper Deviations for Split Times of Branching Processes
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• The Diameter of Sparse Random Graphs
• Flooding in Weighted Sparse Random Graphs
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• The diameter of sparse random graphs

This page was built for publication: The diameter of weighted random graphs