English
Related papers

Related papers: Poisson-Voronoi percolation in higher rank

200 papers

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

Probability · Mathematics 2024-03-13 Philip Easo

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…

Probability · Mathematics 2013-06-10 Vincent Beffara , Hugo Duminil-Copin

We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is…

Probability · Mathematics 2008-11-26 Russell Lyons , Oded Schramm

We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…

Probability · Mathematics 2007-05-23 Itai Benjamini , Russell Lyons , Oded Schramm

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

Probability · Mathematics 2017-04-19 Anders Martinsson

Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…

Probability · Mathematics 2023-03-02 Pengfei Tang

We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…

We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…

Probability · Mathematics 2026-04-23 Antonio Blanca , Reza Gheissari , Heehyun Park , Xusheng Zhang

The main focus of this article concerns the strongly percolative regime of the vacant set of random interlacements on $ \mathbb{Z}^d$, with $d \ge 3$. We investigate the occurrence in a large box of an excessive fraction of sites that get…

Probability · Mathematics 2023-06-29 Alain-Sol Sznitman

The zero cell of a parametric class of random hyperplane tessellations depending on a distance exponent and an intensity parameter is investigated, as the space dimension tends to infinity. The model includes the zero cell of stationary and…

Metric Geometry · Mathematics 2015-08-06 Julia Hoerrmann , Daniel Hug , Matthias Reitzner , Christoph Thaele

In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…

Probability · Mathematics 2009-07-03 Augusto Teixeira

In the present paper I consider Cayley graphs of reflection groups of finite-sided Coxeter polyhedra in 3-dimensional hyperbolic space H^3, with standard sets of generators. As the main result, I prove the existence of non-trivial…

Probability · Mathematics 2013-03-25 Jan Czajkowski

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

Probability · Mathematics 2016-03-04 Jean Bertoin , Geronimo Uribe Bravo

The vacant set of random interlacements at level $u>0$, introduced in arXiv:0704.2560, is a percolation model on $\mathbb{Z}^d$, $d \geq 3$ which arises as the set of sites avoided by a Poissonian cloud of doubly infinite trajectories,…

Probability · Mathematics 2015-01-23 Balazs Rath

We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…

Probability · Mathematics 2022-07-13 Tom Hutchcroft

We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…

Probability · Mathematics 2019-03-27 Tom Hutchcroft

Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…

Probability · Mathematics 2018-04-18 Jan Czajkowski

The Poisson bracket invariants, introduced by Buhovsky, Entov, and Polterovich and further studied by Entov and Polterovich, serve as invariants for quadruples of closed sets in symplectic manifolds. Their nonvanishing has significant…

Symplectic Geometry · Mathematics 2025-05-02 Yaniv Ganor

In this paper, we introduce and study the annealed spectral sample of Voronoi percolation, which is a continuous and finite point process in $\mathbb{R}^2$ whose definition is mostly inspired by the spectral sample of Bernoulli percolation…

Probability · Mathematics 2021-02-15 Hugo Vanneuville

We prove that the set of possible values for the percolation threshold $p_c$ of Cayley graphs has a gap at 1 in the sense that there exists $\varepsilon_0>0$ such that for every Cayley graph $G$ one either has $p_c(G)=1$ or $p_c(G) \leq…

Probability · Mathematics 2021-11-02 Christoforos Panagiotis , Franco Severo