On the mean distance in scale free graphs

DOI10.1007/s11009-005-4518-8zbMath1079.05089OpenAlexW2159743233MaRDI QIDQ2583514

Gerard Hooghiemstra, Piet Van Mieghem

Publication date: 17 January 2006

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-005-4518-8

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items

On a conditionally Poissonian graph process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Metric structure of random networks
• Connected components in random graphs with given expected degree sequences
• Distances in random graphs with finite mean and infinite variance degrees
• The degree sequence of a scale-free random graph process
• A Random Graph Model for Power Law Graphs
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• A critical point for random graphs with a given degree sequence
• A general model of web graphs
• Distances in random graphs with finite variance degrees
• The average distances in random graphs with given expected degrees
• [https://portal.mardi4nfdi.de/wiki/Publication:5618130 La densit� de la loi-limite d'un processus en cascade expansif]