Joint Distribution of Distances in Large Random Regular Networks

DOI10.1239/jap/1378401241zbMath1277.60021OpenAlexW2005232233MaRDI QIDQ2854085

Justin Salez

Publication date: 17 October 2013

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

Full work available at URL: https://projecteuclid.org/euclid.jap/1378401241

zbMATH Keywords

distance matrixfirst passage percolationrandom regular graphconfiguration modelbranching process approximationmultitype Richardson process

Mathematics Subject Classification ID

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

Related Items (3)

Information Spreading in a Large Population of Active Transmitters and Passive Receivers ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Nonmonotonic coexistence regions for the two-type Richardson model on graphs
• Geodesics in first passage percolation
• First-passage competition with different speeds: positive density for both species is impossible
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Some limit theorems for percolation processes with necessary and sufficient conditions
• Coexistence for Richardson type competing spatial growth models
• Absence of mutual unbounded growth for almost all parameter values in the two-type Richardson model.
• First passage percolation on random graphs with finite mean degrees
• The diameter of weighted random graphs
• The two-type Richardson model with unbounded initial configurations
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• Edge flows in the complete random-lengths network
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• More Uses of Exchangeability: Representations of Complex Random Structures
• First Passage Percolation on the Erdős–Rényi Random Graph
• The Probability That a Random Multigraph is Simple
• First passage percolation on locally treelike networks. I. Dense random graphs
• First passage percolation and a model for competing spatial growth
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• Competing first passage percolation on random regular graphs
• Distances in random graphs with finite variance degrees
• The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model

This page was built for publication: Joint Distribution of Distances in Large Random Regular Networks