SearcharxivSearch

arXiv · 2510.13648

Near-critical Ornstein--Zernike theory for the planar random-cluster model

Abstract

We develop an Ornstein--Zernike theory for the two-dimensional random-cluster model with $1 \leq q <4$ that also applies in its near-critical regime. In particular, we prove an asymptotic formula for the two-point function which holds uniformly for~$p < p_c$ and blends the subcritical and near-critical behaviours of the model. The analysis is carried out by studying the renewal properties of a subcritical percolation cluster, \emph{at the scale of the correlation length}. More precisely, we explore sequentially the cluster in a given direction, by slices of thickness comparable to the correlation length. We show that this exploration satisfies the properties of a {\em killed Markov renewal process} -- a class of processes that may be analysed independently and have Brownian behaviour. In addition to the two-point function estimate, we derive other consequences of the Ornstein--Zernike theory such as an invariance principle for the rescaled cluster and the strict convexity of the inverse correlation length -- all at the scale of the correlation length, uniformly in~$p<p_c$. Finally, our approach differs from that of earlier papers of Campanino, Ioffe, Velenik and others, with the cluster being dynamically explored rather than constructed from its diamond decomposition.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucas D'Alimonte, Ioan Manolescu. 2025-10-15. Near-critical Ornstein--Zernike theory for the planar random-cluster model. https://arxiv.org/abs/2510.13648

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