Universality for the distance in finite variance random graphs
From MaRDI portal
Publication:960172
DOI10.1007/s10955-008-9594-zzbMath1152.82008arXivmath/0605414OpenAlexW2122635167MaRDI QIDQ960172
Gerard Hooghiemstra, Remco van der Hofstad, Henri Van Den Esker
Publication date: 16 December 2008
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0605414
Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Distance in graphs (05C12)
Related Items
The mean and variance of the distribution of shortest path lengths of 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, Local weak convergence for PageRank, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, Stochastic recursions on directed random graphs, Diameter in ultra‐small scale‐free random graphs, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, The largest component in a subcritical random graph with a power law degree distribution, The distribution of first hitting times of random walks on directed Erdős–Rényi networks, PageRank on inhomogeneous random digraphs, PageRank's behavior under degree correlations, Evolution of a modified binomial random graph by agglomeration, Universality for the distance in finite variance random graphs, Weighted distances in scale-free configuration models, Diameters in preferential attachment models, Asymptotic equivalence and contiguity of some random graphs, Edge flows in the complete random-lengths network, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Number of edges in inhomogeneous random graphs, The degree sequences of an asymmetrical growing network, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Degree correlations in scale-free random graph models, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Phases of small worlds: a mean field formulation, Large degrees in scale-free inhomogeneous random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating simple random graphs with prescribed degree distribution
- Distance in random graphs with infinite mean degrees
- Universality for the distance in finite variance random graphs
- The asymptotic number of labeled graphs with given degree sequences
- Connected components in random graphs with given expected degree sequences
- Distances in random graphs with finite mean and infinite variance degrees
- Asymptotic equivalence and contiguity of some random graphs
- Probability: A Graduate Course
- A critical point for random graphs with a given degree sequence
- The phase transition in inhomogeneous random graphs
- Distances in random graphs with finite variance degrees
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
