Universality for distances in power-law random graphs

DOI10.1063/1.2982927zbMath1159.81346OpenAlexW2170524605MaRDI QIDQ3624669

Remco van der Hofstad, Gerard Hooghiemstra

Publication date: 30 April 2009

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/bf7c7909-724e-48ed-84f4-c858121adcfd

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Phase transitions (general) in equilibrium statistical mechanics (82B26) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (7)

Not all interventions are equal for the height of the second peak ⋮ Typical Distances in Ultrasmall Random Networks ⋮ The mean and variance of the distribution of shortest path lengths of random regular graphs ⋮ Ising models on power-law random graphs ⋮ The average distance and the diameter of dense random regular graphs ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ Typical distances in a geometric model for complex networks

Cites Work

• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Distance in random graphs with infinite mean degrees
• Connected components in random graphs with given expected degree sequences
• The diameter of a scale-free random graph
• Distances in random graphs with finite mean and infinite variance degrees
• The degree sequence of a scale-free random graph process
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Number of Components in Random Linear Graphs
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• The simple branching process: a note on convergence when the mean is infinite
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• Directed scale-free graphs
• Coupling Scale-Free and Classical Random Graphs
• The Spectra of Random Graphs with Given Expected Degrees
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• A general model of web graphs
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• Random trees and general branching processes
• The diameter of sparse random graphs
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process
• Random Graphs

This page was built for publication: Universality for distances in power-law random graphs