Search Results
Sharp phase transition for Cox percolation
We prove the sharpness of the percolation phase transition for a class of Cox percolation models, i.e., models of continuum percolation in a random environment. The key requirements are that the environment has a finite range of dependence, satisfies a local boundedness condition and can be constructed from a discrete iid random field, however the FKG inequality need not hold. The proof combines the OSSS inequality with a coarse-graining construction that allows us to compare different notions of influence.
Absence of percolation in graphs based on stationary point processes with degrees bounded by two
We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph has no infinite connected component, almost surely. In particular, this extends our previous result for signal-to-interference ratio graphs based on stabilizing Cox point processes and verifies the conjecture of Balister and Bollobás that the bidirectional k-nearest neighbor graph of a two-dimensional homogeneous Poisson point process does not percolate for k=2.