Joint distribution of distances in large random regular networks

DOI10.1239/JAP/1378401241zbMATH Open1277.60021OpenAlexW2005232233MaRDI QIDQ2854085FDOQ2854085

Authors: 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

Recommendations

• Shortest-weight paths in random regular graphs
• Metric structure of random networks
• On Distances in Uniformly Random Networks
• Distance in random graphs with infinite mean degrees
• Edge flows in the complete random-lengths network

zbMATH Keywords

distance matrixfirst passage percolationbranching process approximationconfiguration modelrandom regular graphmultitype Richardson process

Mathematics Subject Classification ID

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

Cites Work

• 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
• The probability that a random multigraph is simple
• First passage percolation on random graphs with finite mean degrees
• First-passage percolation on the random graph
• First passage percolation on the Erdős-Rényi random graph
• Title not available (Why is that?)
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Competing first passage percolation on random regular graphs
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• First passage percolation and a model for competing spatial growth
• The two-type Richardson model with unbounded initial configurations
• First passage percolation on locally treelike networks. I. Dense random graphs
• Distances in random graphs with finite variance degrees
• More uses of exchangeability: representations of complex random structures
• Title not available (Why is that?)
• Diameters in supercritical random graphs via first passage percolation
• Coexistence for Richardson type competing spatial growth models
• Geodesics in first passage percolation
• The diameter of weighted random graphs
• Nonmonotonic coexistence regions for the two-type Richardson model on graphs
• The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model
• Edge flows in the complete random-lengths network
• First-passage competition with different speeds: positive density for both species is impossible
• Absence of mutual unbounded growth for almost all parameter values in the two-type Richardson model.

Cited In (13)

• Edge flows in the complete random-lengths network
• On Distances in Uniformly Random Networks
• The structure of distances in networks
• Title not available (Why is that?)
• Information Spreading in a Large Population of Active Transmitters and Passive Receivers
• Distance-sum heterogeneity in graphs and complex networks
• Resistance distance distribution in large sparse random graphs
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Connected spatial networks over random points and a route-length statistic
• The mean and variance of the distribution of shortest path lengths of random regular graphs
• Comparison of mean distance in superposed networks
• Distance distributions for graphs modeling computer networks
• Diameter of the stochastic mean-field model of distance

This page was built for publication: Joint distribution of distances in large random regular networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854085)