SearcharxivSearch

arXiv · 2509.21253

Capacity in high dimensional percolation

Abstract

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set $A$, the suitably rescaled probability that the cluster of $z$ intersects $A$ converges as $\|z\|\to\infty$. This can be viewed as a generalisation of the asymptotic of the two point function and we call the limit the p-capacity of $A$. We next show that the probability that the Incipient Infinite Cluster of $z$ intersects the set $A$ appropriately normalised is also of order the p-capacity of $A$ as $\|z\|\to\infty$. We conjecture that the p-capacity is of the same order as the $(d-4)$-Bessel-Riesz capacity and in support of this we estimate the p-capacity of balls. As a byproduct of our techniques we give a simpler proof of the one-arm exponent of Kozma and Nachmias for dimensions 8 and higher and as long as the two point function asymptotic holds. Our proofs make use of a new large deviations bound on the pioneers, that is the number of points on the boundary of a box which are part of the cluster of the origin restricted to this box.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amine Asselah, Bruno Schapira, Perla Sousi. 2025-09-25. Capacity in high dimensional percolation. https://arxiv.org/abs/2509.21253

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR