Ultra-small scale-free geometric networks

DOI10.1239/jap/1158784937zbMath1120.60095OpenAlexW2058739025MaRDI QIDQ5754678

Joseph E. Yukich

Publication date: 23 August 2007

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1158784937

zbMATH Keywords

long-range percolationchemical distancescale-free graph

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Transience Versus Recurrence for Scale-Free Spatial Networks ⋮ Recurrence versus transience for weight-dependent random connection models ⋮ Scale-free percolation ⋮ The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects ⋮ Scale-free percolation mixing time ⋮ SIR epidemics on a scale-free spatial nested modular network ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Large degrees in scale-free inhomogeneous random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Renormalization group analysis of the small-world network model
• On the scaling of the chemical distance in long-range percolation models
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• A central limit theorem with applications to percolation, epidemics and Boolean models.
• The diameter of a scale-free random graph
• Statistical mechanics of complex networks
• The diameter of a long-range percolation graph
• The small-world phenomenon
• Uniform Central Limit Theorems
• The Structure and Function of Complex Networks
• Random Geometric Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Collective dynamics of ‘small-world’ networks
• Navigation in small-world networks: a scale-free continuum model
• The average distances in random graphs with given expected degrees