Distances in random graphs with finite mean and infinite variance degrees
From MaRDI portal
Publication:2461987
DOI10.1214/EJP.v12-420zbMath1126.05090arXivmath/0502581MaRDI QIDQ2461987
Gerard Hooghiemstra, Dmitri Znamenski, Remco van der Hofstad
Publication date: 23 November 2007
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502581
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Not all interventions are equal for the height of the second peak, First passage percolation on the Newman-Watts small world model, Typical Distances in Ultrasmall Random Networks, 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, Scale-free network clustering in hyperbolic and other random graphs, Average hopcount of the shortest path in tree-like components with finite size, The structure of typical clusters in large sparse random configurations, Shells structure in uncorrelated scale-free networks, 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?, Branching random walk with infinite progeny mean: a tale of two tails, Chemical distance in geometric random graphs with long edges and scale-free degree distribution, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, Weak disorder asymptotics in the stochastic mean-field model of distance, Rankings in directed configuration models with heavy tailed in-degrees, The winner takes it all but one, Long paths in first passage percolation on the complete graph II. Global branching dynamics, First passage percolation on random graphs with finite mean degrees, Limit distributions of the number of loops in a random configuration graph, Diameter in ultra‐small scale‐free random graphs, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, The distribution of first hitting times of random walks on directed Erdős–Rényi networks, The Diameter of Sparse Random Graphs, The idemetric property: when most distances are (almost) the same, Parking on a random tree, Universality for the distance in finite variance random graphs, Weighted distances in scale-free configuration models, Diameters in preferential attachment models, Contact processes on random graphs with power law degree distributions have critical value 0, Giant Component in Random Multipartite Graphs with Given Degree Sequences, Nonuniversality of weighted random graphs with infinite variance degree, 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, On a conditionally Poissonian graph process, Threshold behaviour and final outcome of an epidemic on a random network with household structure, Leader election using random walks, Linking the mixing times of random walks on static and dynamic random graphs, Limit theorems for assortativity and clustering in null models for scale-free networks, On the mean distance in scale free graphs, First Passage Percolation on Inhomogeneous Random Graphs
