Degree distribution of shortest path trees and bias of network sampling algorithms

DOI10.1214/14-AAP1036zbMath1320.60025arXiv1310.5672MaRDI QIDQ2354885

Shankar Bhamidi, Remco van der Hofstad, Jesse Goodman, Júlia Komjáthy

Publication date: 27 July 2015

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

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

zbMATH Keywords

flowsbiasrandom graphnetwork algorithmspower lawfirst passage percolationBellman-Harris processeshopcountrandom networkweak disordermean-field model of distancestable-age 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short paths for first passage percolation on the complete graph
• Limiting theorems for age-dependent branching processes
• Asymptotics in the random assignment problem
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Length of optimal path in random networks with strong disorder
• The diameter of a scale-free random graph
• First passage percolation on random graphs with finite mean degrees
• Weak disorder asymptotics in the stochastic mean-field model of distance
• The degree sequence of a scale-free random graph process
• Joint Distribution of Distances in Large Random Regular Networks
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• Emergence of Scaling in Random Networks
• First Passage Percolation on the Erdős–Rényi Random Graph
• The growth and composition of branching populations
• The Probability That a Random Multigraph is Simple
• Performance Analysis of Communications Networks and Systems
• Point processes, regular variation and weak convergence
• The Structure and Function of Complex Networks
• 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
• Explosiveness of age-dependent branching processes
• On the bias of traceroute sampling