Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.14882

Large deviations for the isoperimetric constant in 2D percolation

Christian Hirsch·Kyeongsik Nam
View original source ↗Read source document ↗Export metadata ↓

Abstract

Isoperimetric profile describes the minimal boundary size of a set with a prescribed volume. Itai Benjamini conjectured that the isoperimetric profile of the giant component in supercritical percolation experiences an averaging effect and satisfies the law of large numbers. This conjecture was settled by Biskup-Louidor-Procaccia-Rosenthal for 2D percolation, and later resolved by Gold for higher-dimensional lattices. However, more refined properties of the isoperimetric profile, such as fluctuations and large deviations, remain unknown. In this paper, we determine the large deviation probabilities of the isoperimetric constant in 2D supercritical percolation, answering the question by Biskup-Louidor-Procaccia-Rosenthal. Interestingly, while the large deviation probability is of surface order in the entire upper tail regime, a phase transition occurs in the lower tail regime, exhibiting both surface and volume order large deviations.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

BibTeXRIS

Christian Hirsch, Kyeongsik Nam. 2023-09-26. Large deviations for the isoperimetric constant in 2D percolation. https://arxiv.org/abs/2309.14882

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗