Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-26T12:21:21.825Z Has data issue: false hasContentIssue false
  • English
  • Français

Continuum line-of-sight percolation on Poisson–Voronoi tessellations

Part of: Operations research and management science Geometric probability and stochastic geometry Computer system organization Stochastic processes Special processes

Published online by Cambridge University Press:  01 July 2021

Quentin Le Gall Open the ORCID record for Quentin Le Gall [Opens in a new window] ,
Bartłomiej Błaszczyszyn Open the ORCID record for Bartłomiej Błaszczyszyn [Opens in a new window] ,
Élie Cali  and
Taoufik En-Najjary
Quentin Le Gall*
Affiliation:
Orange Labs Networks and Inria—École Normale Supérieure
Bartłomiej Błaszczyszyn*
Affiliation:
Inria—École Normale Supérieure
Élie Cali*
Affiliation:
Orange Labs Networks
Taoufik En-Najjary*
Affiliation:
Orange Labs Networks
*
*Postal address: Orange Labs Networks, Modelling and Statistical Analysis, 44 avenue de la République, CS 50010, 92326 Châtillon Cedex, France.
**Postal address: Centre de recherches Inria de Paris, DYOGENE, 2 rue Simone Iff, CS 42112, 75589 Paris Cedex 12, France.
*Postal address: Orange Labs Networks, Modelling and Statistical Analysis, 44 avenue de la République, CS 50010, 92326 Châtillon Cedex, France.
*Postal address: Orange Labs Networks, Modelling and Statistical Analysis, 44 avenue de la République, CS 50010, 92326 Châtillon Cedex, France.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson–Voronoi tessellation in the d-dimensional Euclidean space. The edges (one-dimensional facets, or simply 1-facets) of this tessellation are the support of a Cox point process, while the vertices (zero-dimensional facets or simply 0-facets) are the support of a Bernoulli point process. Taking the superposition Z of these two processes, two points of Z are linked by an edge if and only if they are sufficiently close and located on the same edge (1-facet) of the supporting tessellation. We study the percolation of the random graph arising from this construction and prove that a 0–1 law, a subcritical phase, and a supercritical phase exist under general assumptions. Our proofs are based on a coarse-graining argument with some notion of stabilization and asymptotic essential connectedness to investigate continuum percolation for Cox point processes. We also give numerical estimates of the critical parameters of the model in the planar case, where our model is intended to represent telecommunications networks in a random environment with obstructive conditions for signal propagation.

Keywords

PercolationCox processPoisson–Voronoi tessellationcoarse-graining argumentssimulation

MSC classification

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory 60G55: Point processes 60D05: Geometric probability and stochastic geometry
Secondary: 68M10: Network design and communication 90B15: Network models, stochastic
Type
Original Article
Information
Advances in Applied Probability , Volume 53 , Issue 2 , June 2021 , pp. 510 - 536
Check for updates
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ahlberg, D., Griffiths, S., Morris, R. and Tassion, V. (2016). Quenched Voronoi percolation. Adv. Math. 286, 889–911.CrossRefGoogle Scholar
Baccelli, F., Błaszczyszyn, B. and Karray, M. (2020). Random Measures, Point Processes, and Stochastic Geometry. Inria. Available at https://hal.inria.fr/hal-02460214.Google Scholar
Balister, P. and Bollobás, B. (2013). Percolation in the k-nearest neighbor graph. In Recent Results in Designs and Graphs: a Tribute to Lucia Gionfriddo (Quaderni di Matematica 28), Aracne, pp. 83–100.Google Scholar
Balister, P., Bollobás, B. and Quas, A. (2005). Percolation in Voronoi tilings. Random Structures Algorithms 26, 310–318.CrossRefGoogle Scholar
Balister, P., Sarkar, A. and Bollobás, B. (2008). Percolation, connectivity, coverage and colouring of random geometric graphs. In Handbook of Large-Scale Random Networks (Bolyai Society Math. Studies 18), Springer, Berlin, Heidelberg, pp. 117–142.CrossRefGoogle Scholar
Becker, A. M. and Ziff, R. M. (2009). Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations. Phys. Rev. E 80, 041101.CrossRefGoogle ScholarPubMed
Beringer, D., Pete, G. and Timár, á. (2017). On percolation, critical probabilities and unimodular random graphs. Electron. J. Prob. 22, 1–26.CrossRefGoogle Scholar
Błaszczyszyn, B. (2017). Lecture Notes on Random Geometric Models—Random Graphs, Point Processes and Stochastic Geometry. Available at https://hal.inria.fr/cel-01654766.Google Scholar
Blaszczyszyn, B. and Yogeshwaran, D. (2010). Connectivity in sub-Poisson Networks. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Institute of Electrical and Electronics Engineers, pp. 1466–1473.CrossRefGoogle Scholar
Błaszczyszyn, B. and Yogeshwaran, D. (2013). Clustering and percolation of point processes. Electron. J. Prob. 18, 1–20.CrossRefGoogle Scholar
Błaszczyszyn, B. and Yogeshwaran, D. (2015). Clustering comparison of point processes, with applications to random geometric models. In Stochastic Geometry, Spatial Statistics and Random Fields, Springer, Cham, pp. 31–71.CrossRefGoogle Scholar
Błaszczyszyn, B., Yogeshwaran, D. and Yukich, J. E. (2019). Limit theory for geometric statistics of point processes having fast decay of correlations. Ann. Prob. 47, 835–895.CrossRefGoogle Scholar
Bollobás, B., Janson, S. and Riordan, O. (2009). Line-of-sight percolation. Combinatorics Prob. Comput. 18, 83–106.CrossRefGoogle Scholar
Bollobás, B. and Riordan, O. (2006). The critical probability for random Voronoi percolation in the plane is 1/2. Prob. Theory Relat. Fields 136, 417–468.CrossRefGoogle Scholar
Bollobás, B. and Riordan, O. (2008). Percolation on random Johnson–Mehl tessellations and related models. Prob. Theory Relat. Fields 140, 319–343.CrossRefGoogle Scholar
Broadbent, S. R. and Hammersley, J. M. (1957). Percolation processes. I. Crystals and mazes. Proc. Camb. Phil. Soc. 53, 629–641.CrossRefGoogle Scholar
Cali, E. et al. (2018). Percolation for D2D networks on street systems. In 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Institute of Electrical and Electronics Engineers, pp. 1–6.Google Scholar
Chiu, S. N., Stoyan, D., Kendall, W. S. and Mecke, J. (2013). Stochastic Geometry and Its Applications, 3rd edn. John Wiley, New York.CrossRefGoogle Scholar
Daley, D. J. and Vere-Jones, D. (2008). An Introduction to the Theory of Point Processes: Volume II: General Theory and Structure. Springer, New York.Google Scholar
Dousse, O. et al. (2006). Percolation in the signal to interference ratio graph. J. Appl. Prob. 43, 552–562.CrossRefGoogle Scholar
Flimmel, D., Pawlas, Z. and Yukich, J. E. (2019). Limit theory for unbiased and consistent estimators of statistics of random tessellations. Preprint. Available at https://arxiv.org/abs/1906.03097.Google Scholar
Frieze, A., Kleinberg, J., Ravi, R. and Debany, W. (2009). Line-of-sight networks. Combinatorics Prob. Comput. 18, 145–163.CrossRefGoogle Scholar
Ghosh, S., Krishnapur, M. and Peres, Y. (2016). Continuum percolation for Gaussian zeroes and Ginibre eigenvalues. Ann. Prob. 44, 3357–3384.CrossRefGoogle Scholar
Gilbert, E. N. (1961). Random plane networks. J. SIAM 9, 533–543.Google Scholar
Gloaguen, C., Fleischer, F., Schmidt, H. and Schmidt, V. (2006). Fitting of stochastic telecommunication network models via distance measures and Monte-Carlo tests. Telecommun. Systems 31, 353–377.CrossRefGoogle Scholar
Hirsch, C., Jahnel, B. and Cali, E. (2019). Continuum percolation for Cox point processes. Stoch. Process. Appl. 129, 3941–3966.CrossRefGoogle Scholar
Jahnel, B. and König, W. (2020). Probabilistic Methods in Telecommunications. Birkhäuser, Basel.CrossRefGoogle Scholar
Jansen, S. (2016). Continuum percolation for Gibbsian point processes with attractive interactions. Electron. J. Prob. 21, 1–22.CrossRefGoogle Scholar
Last, G. and Penrose, M. (2017). Lectures on the Poisson Process. Cambridge University Press.CrossRefGoogle Scholar
Le Gall, Q., Błaszczyszyn, B., Cali, E. and En-Najjary, T. (2019). The influence of canyon shadowing on device-to-device connectivity in urban scenario. In 2019 IEEE Wireless Communications and Networking Conference, Institute of Electrical and Electronics Engineers.Google Scholar
Liggett, T. M., Schonmann, R. H. and Stacey, A. M. (1997). Domination by product measures. Ann. Prob. 25, 71–95.CrossRefGoogle Scholar
Meester, R. and Roy, R. (1996). Continuum Percolation. Cambridge University Press.CrossRefGoogle Scholar
MØller, J. (1989). Random tessellations in $\mathbb{R}^{d}$ . Adv. Appl. Prob. 21, 37–73.CrossRefGoogle Scholar
MØller, J. (2012). Lectures on Random Voronoi Tessellations. Springer, New York.Google Scholar
Muche, L. (2005). The Poisson–Voronoi tessellation: relationships for edges. Adv. Appl. Prob. 37, 279–296.CrossRefGoogle Scholar
Neher, R. A., Mecke, K. and Wagner, H. (2008). Topological estimation of percolation thresholds. J. Statist. Mech. Theory Experiment 2008, P01011.CrossRefGoogle Scholar
Okabe, A., Boots, B., Sugihara, K. and Chiu, S. N. (1992). Spatial Tessellations. John Wiley, New York.Google Scholar
Poinas, A., Delyon, B. and Lavancier, F. (2019). Mixing properties and central limit theorem for associated point processes. Bernoulli 25, 1724–1754.CrossRefGoogle Scholar
Stucki, K. (2013). Continuum percolation for Gibbs point processes. Electron. Commun. Prob. 18, 1–10.CrossRefGoogle Scholar
Tassion, V. (2016). Crossing probabilities for Voronoi percolation. Ann. Prob. 44, 3385–3398.CrossRefGoogle Scholar
Tóbiás, A. (2020). Signal to interference ratio percolation for Cox point processes. ALEA Latin Amer. J. Prob. Math. Statist. 17, 273–308.CrossRefGoogle Scholar
Vahidi-Asl, M. Q. and Wierman, J. C. (1990). First-passage percolation on the Voronoi tessellation and Delaunay triangulation. Random Graphs 87, 341–359.Google Scholar
Ziesche, S. (2016). Bernoulli percolation on random tessellations. Preprint. Available at https://arxiv.org/abs/1609.04707.Google Scholar
Ziesche, S. (2016). First passage percolation in Euclidean space and on random tessellations. Preprint. Available at https://arxiv.org/abs/1611.02005.Google Scholar