SearcharxivSearch

arXiv · 2604.08623

Central limit theorem for the Allen-Cahn equation with supercritical random initial conditions

Abstract

We study the large-scale behavior of solutions to the Allen-Cahn reaction-diffusion equation with Gaussian initial data. We consider the case of short-range dependence in the associated supercritical regime with spatial dimension $d \ge 3$. Under diffusive rescaling, the non-linearity formally vanishes on large scales in this case. Accordingly, we prove a central limit theorem for the rescaled solution, more precisely, that it converges to the solution of the heat equation started from a white noise. These initial conditions for the limit depend non-trivially both on the source of randomness and on the non-linearity. Our proof uses estimates obtained by a combination of comparison principles and Malliavin calculus, initiated by Castillo and Dunlap in arXiv:2509.06260 in the critical case. However, the result there is not a fluctuation result but rather an $L^2_\mathbf{P}$ comparison to a McKean-Vlasov problem with Gaussian solutions. Hence the mechanism behind the Gaussianity of the limit differs, and the proof requires new ideas that should be further applicable to other supercritical problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Colin Piernot, Kexing Ying. 2026-04-09. Central limit theorem for the Allen-Cahn equation with supercritical random initial conditions. https://arxiv.org/abs/2604.08623

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