Connectivity in Sub-Poisson Networks
Bartlomiej Blaszczyszyn, D. Yogeshwaran

TL;DR
This paper investigates how sub-Poisson point processes, which are more regular than Poisson processes, influence connectivity in continuum percolation models like Gilbert's graph and SINR graphs, extending classical phase transition results.
Contribution
It extends the classical phase transition results for Gilbert's and SINR graphs from Poisson to sub-Poisson point processes, broadening understanding of network connectivity in more regular point distributions.
Findings
Sub-Poisson processes exhibit similar phase transition behavior as Poisson processes in percolation models.
Perturbed lattices are examples of sub-Poisson processes, ranging from regular grids to clustered patterns.
The results apply to models relevant for wireless network connectivity analysis.
Abstract
We consider a class of point processes (pp), which we call {\em sub-Poisson}; these are pp that can be directionally-convexly () dominated by some Poisson pp. The order has already been shown useful in comparing various point process characteristics, including Ripley's and correlation functions as well as shot-noise fields generated by pp, indicating in particular that smaller in the order processes exhibit more regularity (less clustering, less voids) in the repartition of their points. Using these results, in this paper we study the impact of the ordering of pp on the properties of two continuum percolation models, which have been proposed in the literature to address macroscopic connectivity properties of large wireless networks. As the first main result of this paper, we extend the classical result on the existence of phase transition in the percolation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
