Structures in supercritical scale-free percolation

DOI10.1214/16-AAP1270zbMath1373.60158arXiv1604.08180OpenAlexW2343433175MaRDI QIDQ1676451

Joost Jorritsma, Tim Hulshof, Markus Heydenreich

Publication date: 7 November 2017

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

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

zbMATH Keywords

hierarchical clusteringpercolationrandom graphsgraph distancescale-free networkreal-world network modelingtransience versus recurrence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (15)

Graph distances in scale-free percolation: the logarithmic case ⋮ Transience Versus Recurrence for Scale-Free Spatial Networks ⋮ Recurrence versus transience for weight-dependent random connection models ⋮ Random walk on the random connection model ⋮ Local limits of spatial inhomogeneous random graphs ⋮ Recurrence and transience of symmetric random walks with long-range jumps ⋮ Scale-free percolation mixing time ⋮ Geometric inhomogeneous random graphs ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Percolation phase transition in weight-dependent random connection models

This page was built for publication: Structures in supercritical scale-free percolation