First Passage Percolation on Inhomogeneous Random Graphs

DOI10.1239/aap/1435236989zbMath1317.05176arXiv1201.3137OpenAlexW1908254782MaRDI QIDQ5262455

No author found.

Publication date: 15 July 2015

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

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

zbMATH Keywords

first passage percolationhopcountinhomogeneous random graphcontinuous-time multitype branching processshortest-weight path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Applications of branching processes (60J85)

Related Items (6)

First passage percolation on the Newman-Watts small world model ⋮ Information Spreading in a Large Population of Active Transmitters and Passive Receivers ⋮ Long paths in first passage percolation on the complete graph II. Global branching dynamics ⋮ Random shortest paths: non-Euclidean instances for metric optimization problems ⋮ Weighted distances in scale-free configuration models ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the epidemic curve
• Generating simple random graphs with prescribed degree distribution
• The diameter of random regular graphs
• Connected components in random graphs with given expected degree sequences
• First passage percolation on random graphs with finite mean degrees
• The diameter of weighted random graphs
• Weak disorder asymptotics in the stochastic mean-field model of distance
• Distances in random graphs with finite mean and infinite variance degrees
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• First Passage Percolation on the Erdős–Rényi Random Graph
• First passage percolation on locally treelike networks. I. Dense random graphs
• Almost Sure Behavior of Linear Functionals of Supercritical Branching Processes
• 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
• The Numbers of Generations in a Branching Process with an Arbitrary Set of Particle Types
• The front of the epidemic spread and first passage percolation
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• The diameter of sparse random graphs
• On a conditionally Poissonian graph process
• Generations and degree of relationship in supercritical Markov branching processes

This page was built for publication: First Passage Percolation on Inhomogeneous Random Graphs