The Fourier spectrum of critical percolation

  title={The Fourier spectrum of critical percolation},
  author={Christophe Garban and G{\'a}bor Pete and Oded Schramm},
  journal={Acta Mathematica},
Consider the indicator function f of a 2-dimensional percolation crossing event. In this paper, the Fourier transform of f is studied and sharp bounds are obtained for its lower tail in several situations. Various applications of these bounds are derived. In particular, we show that the set of exceptional times of dynamical critical site percolation on the triangular grid in which the origin percolates has dimension ${\frac{31}{36}}$ almost surely, and the corresponding dimension in the half… 
The annealed spectral sample of Voronoi percolation
In this paper, we 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
In this paper, we introduce and study the annealed spectral sample of Voronoi percolation, which is a continuous and finite point process in R whose definition is mostly inspired by the spectral
The scaling limits of near-critical and dynamical percolation
We prove that near-critical percolation and dynamical percolation on the triangular lattice $\eta \mathbb{T}$ have a scaling limit as the mesh $\eta \to 0$, in the "quad-crossing" space $\mathcal{H}$
On the chemical distance in critical percolation
We consider two-dimensional critical bond percolation. Conditioned on the existence of an open circuit in an annulus, we show that the ratio of the expected size of the shortest open circuit to the
Asymmetry of near-critical percolation interfaces
We study the possible scaling limits of percolation interfaces in two dimensions on the triangular lattice. When one lets the percolation parameter p(N) vary with the size N of the box that one is
Quantitative quenched Voronoi percolation and applications
In [AGMT16], Ahlberg, Griffiths, Morris and Tassion prove that, asymptotically almost surely, the quenched crossing probabilities for critical planar Voronoi percolation do not depend on the
Noise sensitivity of percolation via differential inequalities
Consider critical Bernoulli percolation in the plane. We give a new proof of the sharp noise sensitivity theorem shown by Garban, Pete and Schramm. Contrary to the previous approaches, we do not use
Convergence Towards an Asymptotic Shape in First-Passage Percolation on Cone-Like Subgraphs of the Integer Lattice
In first-passage percolation on the integer lattice, the shape theorem provides precise conditions for convergence of the set of sites reachable within a given time from the origin, once rescaled, to
Transitions for exceptional times in dynamical first-passage percolation
In first-passage percolation (FPP), we let (τv) be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If F is the distribution
Exceptional times for percolation under exclusion dynamics
We analyse in this paper a conservative analogue of the celebrated model of dynamical percolation introduced by H\"aggstr\"om, Peres and Steif in [HPS97]. It is simply defined as follows: start with


Quantitative noise sensitivity and exceptional times for percolation
One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise
Values of Brownian intersection exponents, I: Half-plane exponents
Theoretical physics predicts that conformal invariance plays a crucial role in the macroscopic behavior of a wide class of two-dimensional models in statistical physics (see, e.g., [4], [6]). For
Values of Brownian intersection exponents, II: Plane exponents
This paper is the follow-up of the paper [27], in which we derived the exact value of intersection exponents between Brownian motions in a half-plane. In the present paper, we will derive the value
The incipient infinite cluster in two-dimensional percolation
SummaryLetPp be the probability measure on the configurations of occupied and vacant vertices of a two-dimensional graphG, under which all vertices are independently occupied (respectively vacant)
Dynamical percolation on general trees
Häggström et al. (Ann Inst H Poincaré Probab Stat 33(4):497–528, 1997) have introduced a dynamical version of percolation on a graph G. When G is a tree they derived a necessary and sufficient
Almost All Words Are Seen In Critical Site Percolation On The Triangular Lattice
We consider critical site percolation on the triangular lattice, that is, we choose $X(v) = 0$ or 1 with probability 1/2 each, independently for all vertices $v$ of the triangular lattice. We say
Domination by product measures
We consider families of(0,1)-valued random variables indexed by the vertices of countable graphs with bounded degree. First we show that if these random variables satisfy the property that
Recurrence of Simple Random Walk on $Z^2$ is Dynamically Sensitive
Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there
Scaling relations for 2D-percolation
We prove that the relations 2D-percolation hold for the usual critical exponents for 2D-percolation, provided the exponents δ andv exist. Even without the last assumption various relations