Paper detail

On percolation in Poisson graphs

Equip each point $x$ of a homogeneous Poisson process $\mathcal{P}$ on $\mathbb{R}$ with $D_x$ edge stubs, where the $D_x$ are i.i.d. positive integer-valued random variables with distribution given by $μ$. Following the stable multi-matching scheme introduced by Deijfen, Häggstrom and Holroyd (2012), we pair off edge stubs in a series of rounds to form the edge set of an infinite component $G$ on the vertex set $\mathcal{P}$. In this note, we answer questions of Deijfen, Holroyd and Peres (2011) and Deijfen, Häggström and Holroyd (2012) on percolation (the existence of an infinite connected component) in $G$. We prove that percolation may occur a.s. even if $μ$ has support over odd integers. Furthermore, we show that for any $\varepsilon>0$ there exists a distribution $μ$ such that $μ(\{1\})>1-\varepsilon$ such that percolation still occurs a.s..