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 versus 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.
Citation
Markus Heydenreich. Tim Hulshof. Joost Jorritsma. "Structures in supercritical scale-free percolation." Ann. Appl. Probab. 27 (4) 2569 - 2604, August 2017. https://doi.org/10.1214/16-AAP1270
Information