PreprintCC BY 4.0HAL
On the number of pioneers in high-dimensional critical percolation
Abstract
We prove that for critical percolation in high dimension the expected number of pioneers on any set containing the origin is of the same order as the probability that a simple random walk starting from the origin exits the set. Our proof works in all dimensions d > 6, under the usual assumption that the two-point function is of the same order as the Green's function. As an application we obtain a sharp uniform quantitative bound on the probability that the cluster of the origin intersects any given ball.
Related
- High-dimensional critical percolation and critical Branching random walks are intersection equivalent
- Super-Brownian limits and the k-point function for high-dimensional percolation
- On the critical value of void percolation in high dimensions
- A new approach for estimating the number of spikes in high-dimensional Gaussian models
- Global well-posedness and scattering of energy-critical defocusing nonlinear Schrödinger equation on high-dimensional hyperbolic spaces
BibTeX
@misc{asselah2026number,
title = {{On the number of pioneers in high-dimensional critical percolation}},
author = {Amine Asselah and Bruno Schapira},
howpublished = {HAL},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.35553},
eprint = {2610.35553},
archivePrefix = {arXiv},
url = {https://hal.science/hal-05839694v1},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the number of pioneers in high-dimensional critical percolation
AU - Amine Asselah
AU - Bruno Schapira
PY - 2026
DA - 2026/10/26
PB - HAL
DO - 10.48550/arxiv.2610.35553
UR - https://hal.science/hal-05839694v1
AB - We prove that for critical percolation in high dimension the expected number of pioneers on any set containing the origin is of the same order as the probability that a simple random walk starting from the origin exits the set. Our proof works in all dimensions d > 6, under the usual assumption that the two-point function is of the same order as the Green's function. As an application we obtain a sharp uniform quantitative bound on the probability that the cluster of the origin intersects any given ball.
ER -