Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks

DOI10.1239/aap/1282924060zbMath1208.60007arXiv0905.4438OpenAlexW2143834312MaRDI QIDQ3059693

Remco van der Hofstad, Gerard Hooghiemstra, Shankar Bhamidi

Publication date: 26 November 2010

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

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

zbMATH Keywords

random graphfirst passage percolationconfiguration modelscale-free networkpower law degree distribution

Mathematics Subject Classification ID

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

Related Items

Local neighbourhoods for first-passage percolation on the configuration model, Weak disorder asymptotics in the stochastic mean-field model of distance, The winner takes it all but one, Long paths in first passage percolation on the complete graph II. Global branching dynamics, Limiting distributions of generalised Poisson-Dirichlet distributions based on negative binomial processes, First passage percolation on random graphs with finite mean degrees, Weighted distances in scale-free configuration models, Epidemics and vaccination on weighted graphs, Competing first passage percolation on random regular graphs, Joint Distribution of Distances in Large Random Regular Networks, The diameter of weighted random graphs, Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The contribution to the sum of the summand of maximum modulus
• Distance in random graphs with infinite mean degrees
• The asymptotic number of labeled graphs with given degree sequences
• The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator
• The flooding time in random graphs
• First passage percolation on random graphs with finite mean degrees
• Distances in random graphs with finite mean and infinite variance degrees
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• Edge flows in the complete random-lengths network
• First passage percolation on locally treelike networks. I. Dense random graphs
• The Structure and Function of Complex Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• A critical point for random graphs with a given degree sequence
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Distances in random graphs with finite variance degrees