Vanishing uniqueness thresholds in Voronoi percolation on products
Matteo D'Achille, Jan Grebík, Ali Khezeli, Konstantin Recke, Amanda Wilkens
TL;DR
The paper develops a robust local-to-global framework for Poisson--Voronoi and Bernoulli--Voronoi percolation on non-amenable product spaces, proving that the uniqueness threshold $p_u(λ)$ vanishes as $λ\to0$ in a broad class of discrete and continuum settings. It introduces the unbounded borders phenomenon for ideal Voronoi tessellations and leverages it, together with product structure, to replace property (T) and obtain long-range order from local information. The main contributions include proving vanishing $p_u(λ)$ for k-fold tree products and for products of hyperbolic spaces and higher rank symmetric spaces (including cases without property (T)), plus new FIID sparse unique infinite cluster examples in both discrete and continuum contexts. These results yield new non-amenable Cayley graphs with FIID sparse infinite clusters and provide a flexible, broadly applicable method for establishing global connectivity from local data in complex geometric settings.
Abstract
We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(λ)$ at small intensities $λ>0$ based on the unbounded borders phenomenon of their underlining ideal Poisson--Voronoi tessellation. We apply our method to several concrete examples in both the discrete and the continuum setting, including $k$-fold graph products of $d$-regular trees for $k\ge2,d\ge3$ and products of hyperbolic spaces $\mathbb H_{d_1}\times \ldots \times \mathbb H_{d_k}$ for $k\ge2, d_i\ge2$, complementing a recent result of the second and fourth author for symmetric spaces of connected higher rank semisimple real Lie groups with property (T). We also provide new examples of non-amenable Cayley graphs with the FIID sparse unique infinite cluster property, answering positively a recent question of Pete and Rokob.
