Distances in random graphs with finite variance degrees
From MaRDI portal
Publication:5311913
DOI10.1002/rsa.20063zbMath1074.05083arXivmath/0407092OpenAlexW2952242105MaRDI QIDQ5311913
Piet Van Mieghem, Gerard Hooghiemstra, Remco van der Hofstad
Publication date: 29 August 2005
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0407092
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (45)
Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Strong couplings for static locally tree-like random graphs ⋮ The mean and variance of the distribution of shortest path lengths of random regular graphs ⋮ The tail does not determine the size of the giant ⋮ Analytical results for the distribution of first-passage times of random walks on random regular graphs ⋮ Average hopcount of the shortest path in tree-like components with finite size ⋮ The structure of typical clusters in large sparse random configurations ⋮ Typical distances in the directed configuration model ⋮ Short paths for first passage percolation on the complete graph ⋮ Scale-free percolation ⋮ Distance in random graphs with infinite mean degrees ⋮ On analytical approaches to epidemics on networks ⋮ When is a scale-free graph ultra-small? ⋮ Weak disorder asymptotics in the stochastic mean-field model of distance ⋮ Tail behavior of solutions of linear recursions on trees ⋮ The average distance and the diameter of dense random regular graphs ⋮ The winner takes it all but one ⋮ First passage percolation on random graphs with finite mean degrees ⋮ Diameter in ultra‐small scale‐free random graphs ⋮ The largest component in a subcritical random graph with a power law degree distribution ⋮ Optimal subgraph structures in scale-free configuration models ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ The Diameter of Sparse Random Graphs ⋮ The idemetric property: when most distances are (almost) the same ⋮ Universality for the distance in finite variance random graphs ⋮ Weighted distances in scale-free configuration models ⋮ Diameters in preferential attachment models ⋮ Epidemics and vaccination on weighted graphs ⋮ Giant Component in Random Multipartite Graphs with Given Degree Sequences ⋮ Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks ⋮ Universality for distances in power-law random graphs ⋮ First passage percolation on locally treelike networks. I. Dense random graphs ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Construction of Directed Assortative Configuration Graphs ⋮ On a conditionally Poissonian graph process ⋮ Degree correlations in scale-free random graph models ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ Directed random graphs with given degree distributions ⋮ Linking the mixing times of random walks on static and dynamic random graphs ⋮ Counting triangles in power-law uniform random graphs ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks ⋮ Joint Distribution of Distances in Large Random Regular Networks ⋮ On the mean distance in scale free graphs ⋮ First Passage Percolation on Inhomogeneous Random Graphs ⋮ The diameter of weighted random graphs
Cites Work
This page was built for publication: Distances in random graphs with finite variance degrees
