From heavy-tailed Boolean models to scale-free Gilbert graphs

DOI10.1214/15-BJPS305zbMath1380.60087arXiv1411.6824OpenAlexW2231683461MaRDI QIDQ519736

Christian Hirsch

Publication date: 5 April 2017

Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6824

zbMATH Keywords

Boolean modelrandom geometric graphscale-free networkfirst-passage percolationchemical distances

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) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (6)

Transience Versus Recurrence for Scale-Free Spatial Networks ⋮ Recurrence versus transience for weight-dependent random connection models ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects ⋮ Normal approximation for stabilizing functionals ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs

This page was built for publication: From heavy-tailed Boolean models to scale-free Gilbert graphs