Continuum percolation with steps in an annulus (Q1769415): Difference between revisions

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.