Continuum percolation with steps in an annulus

From MaRDI portal
(Redirected from Publication:1769415)



Abstract: Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-epsilon) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1 and let G_A be the random graph with vertex set {x_i} and edges x_ix_j whenever x_i-x_jin A. We show that if the area of A is large, then G_A almost surely has an infinite component. Moreover, if we fix epsilon, increase r and let n_c=n_c(epsilon) be the area of A when this infinite component appears, then n_c o1 as epsilon o 0. This is in contrast to the case of a ``square annulus where we show that n_c is bounded away from 1.


The percolation problem deals with the propagation of a message through a network of transmitters distributed at random in the plane. This problem has been deeply investigated for convex domain, and here one considers non-convex bodies, and more especially transmitters distributed in an annulus. It is shown that when the area of the annulus is large, then almost surely the graph associated with the network has an infinite component.











This page was built for publication: Continuum percolation with steps in an annulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769415)