Structures in supercritical scale-free percolation
  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. 
Markus Heydenreich, Tim Hulshof, and Joost Jorritsma
math.PR math.CO