Brazilian Journal of Probability and Statistics

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

Christian Hirsch

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Define the scale-free Gilbert graph based on a Boolean model with heavy-tailed radius distribution on the $d$-dimensional torus by connecting two centers of balls by an edge if at least one of the balls contains the center of the other. We investigate two asymptotic properties of this graph as the size of the torus tends to infinity. First, we determine the tail index associated with the asymptotic distribution of the sum of all power-weighted incoming and outgoing edge lengths at a randomly chosen vertex. Second, we study the behavior of chemical distances on scale-free Gilbert graphs and show the existence of different regimes depending on the tail index of the radius distribution. Despite some similarities to long-range percolation and ultra-small scale-free geometric networks, scale-free Gilbert graphs are actually more closely related to fractal percolation and this connection gives rise to different scaling limits. We also propose a modification of the graph, where the total number of edges can be reduced substantially at the cost of introducing a logarithmic factor in the chemical distances.

Article information

Braz. J. Probab. Stat., Volume 31, Number 1 (2017), 111-143.

Received: April 2015
Accepted: December 2015
First available in Project Euclid: 25 January 2017

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Scale-free network Boolean model random geometric graph first-passage percolation chemical distances


Hirsch, Christian. From heavy-tailed Boolean models to scale-free Gilbert graphs. Braz. J. Probab. Stat. 31 (2017), no. 1, 111--143. doi:10.1214/15-BJPS305.

Export citation


  • Aldous, D. J. (2009). Which connected spatial networks on random points have linear route-lengths? Arxiv preprint. Available at arXiv:0911.5296.
  • Appleby, S. (1995). Estimating the cost of a telecommunications network using the fractal structure of the human population distribution. IEE Proceedings—Communications 142, 172–178. DOI: 10.1049/ip-com:19951934.
  • Appleby, S. (1996). Multifractal characterization of the distribution pattern of the human population. Geographical Analysis 28, 147–160.
  • Baccelli, F. and Zuyev, S. (1999). Poisson–Voronoi spanning trees with applications to the optimization of communication networks. Operations Research 47, 619–631.
  • Biskup, M. (2004). On the scaling of the chemical distance in long-range percolation models. The Annals of Probability 32, 2938–2977.
  • Biskup, M. (2011). Graph diameter in long-range percolation. Random Structures and Algorithms 39, 210–227.
  • Coppersmith, D., Gamarnik, D. and Sviridenko, M. (2002). The diameter of a long-range percolation graph. Random Structures and Algorithms 21, 1–13.
  • Daley, D. J. and Last, G. (2005). Descending chains, the lilypond model, and mutual-nearest-neighbour matching. Advances in Applied Probability 37, 604–628.
  • Deijfen, M., van der Hofstad, R. and Hooghiemstra, G. (2013). Scale-free percolation. Annales de l’Institut Henri Poincaré Probabilités et Statistiques 49, 817–838.
  • Deprez, P. and Wüthrich, M. V. (2015). Networks, random graphs and percolation. In Theoretical Aspects of Spatial-Temporal Modeling (G. W. Peters and T. Matsui, eds.). JSS Research Series in Statistics 95–124. Tokyo: Springer.
  • Deprez, P. and Wüthrich, M. V. (2013). Poisson heterogeneous random-connection model. Arxiv preprint. Available at arXiv:1312.1948.
  • Falconer, K. J. and Grimmett, G. R. (1992). On the geometry of random Cantor sets and fractal percolation. Journal of Theoretical Probability 5, 465–485.
  • Holroyd, A. E., Pemantle, R., Peres, Y. and Schramm, O. (2009). Poisson matching. Annales de l’Institut Henri Poincaré Probabilités et Statistiques 45, 66–287.
  • Harris, T. E. (1963). The Theory of Branching Processes. Berlin: Springer.
  • Jacob, E. and Mörters, P. (2015a). Spatial preferential attachment networks: Power laws and clustering coefficients. Annals of Applied Probability 25, 632–662.
  • Jacob, E. and Mörters, P. (2015b). Robustness of scale-free spatial networks. Arxiv preprint. Available at arXiv:1504.00618.
  • Last, G. and Penrose, M. D. (2011). Poisson process Fock space representation, chaos expansion and covariance inequalities. Probability Theory and Related Fields 150, 663–690.
  • Lawler, G. F. (1980). A self-avoiding random walk. Duke Mathematical Journal 47, 655–693.
  • Liggett, T. M., Schonmann, R. H. and Stacey, A. M. (1997). Domination by product measures. Annals of Probability 25, 71–95.
  • Mannersalo, P., Koski, A. and Norros, I. (1998). Telecommunication networks and multifractal analysis of human population distribution. Technical Report COST257(98)02. Available at
  • Menshikov, M. V., Popov, S. Y. and Vachkovskaia, M. (2001). On the connectivity properties of the complementary set in fractal percolation models. Probability Theory and Related Fields 119, 176–186.
  • Penrose, M. D. (2003). Random Geometric Graphs. Oxford: Oxford University Press.
  • Schneider, R. and Weil, W. (2008). Stochastic and Integral Geometry. Berlin: Springer.
  • Tchoumatchenko, K. and Zuyev, S. (2001). Aggregate and fractal tessellations. Probability Theory and Related Fields 121, 198–218.
  • Yukich, J. E. (2006). Ultra-small scale-free geometric networks. Journal of Applied Probability 43, 665–677.