Structures in supercritical scale-free percolation

DOI10.1214/16-AAP1270zbMATH Open1373.60158OpenAlexW2343433175MaRDI QIDQ1676451FDOQ1676451

Authors Markus Heydenreich, Tim Hulshof, Joost Jorritsma

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)

Abstract: Scale-free percolation is a percolation model on $mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs. recurrence for dimension 1 and 2 and give sufficient conditions for transience in dimension 3 and higher. Finally, we show the existence of a hierarchical structure for parameters where vertices have degrees with infinite variance and obtain bounds on the cluster density.

Recommendations

• Supercritical percolation on large scale-free random trees
• Scale-free percolation
• Graph distances in scale-free percolation: the logarithmic case
• Scale-free percolation in continuum space
• Scale-free percolation in continuous space: quenched degree and clustering coefficient

Cited in

(26)

• Arithmetic oscillations of the chemical distance in long-range percolation on \(\mathbb{Z}^d\)
• Graph distances in scale-free percolation: the logarithmic case
• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• Scale-free percolation in continuum space
• Recurrence versus transience for weight-dependent random connection models
• Random walk on the random connection model
• Sampling geometric inhomogeneous random graphs in linear time
• Discrete scale invariance in supercritical percolation
• Barely supercritical percolation on Poissonian scale-free networks
• Scale-free percolation in continuous space: quenched degree and clustering coefficient
• Cover and hitting times of hyperbolic random graphs
• Penalising transmission to hubs in scale-free spatial random graphs
• Scale-free percolation mixing time
• Ultra-small scale-free geometric networks
• Scale-free percolation
• The shape of large balls in highly supercritical percolation
• Recurrence and transience of symmetric random walks with long-range jumps
• Multi-type directed scale-free percolation
• Inhomogeneous long-range percolation in the weak decay regime
• Greedy routing and the algorithmic small-world phenomenon
• Local limits of spatial inhomogeneous random graphs
• Infinite and Giant Components in the Layers Percolation Model
• Geometric inhomogeneous random graphs
• Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
• Percolation phase transition in weight-dependent random connection models
• Transience versus recurrence for scale-free spatial networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676451)