SearcharxivSearch

arXiv · 2402.19070

Interface fluctuations for $1$D stochastic Allen-Cahn equation revisited

Abstract

We revisit the interface fluctuation problem for the $1$D Allen-Cahn equation perturbed by a small space-time white noise. We show that if the initial data is a standing wave solution to the deterministic equation, then under proper long time scale, the solution is still close to the family of traveling wave solutions. Furthermore, the motion of the interface converges to an explicit stochastic differential equation. This extends the classical result in \cite{Fun95} to full small noise regime, and recovers the result in \cite{BBDMP98}. The proof builds on the analytic framework in \cite{Fun95}. Our main novelty is the construction of a series of functional correctors that are designed to recursively cancel potential divergences. Moreover, to show these correctors are well-behaved, we develop a systematic decomposition of Fr\'echet derivatives of the deterministic Allen-Cahn flow of all orders. This decomposition is of its own interest, and may be useful in other situations as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Weijun Xu, Wenhao Zhao, Shuhan Zhou. 2024-02-29. Interface fluctuations for $1$D stochastic Allen-Cahn equation revisited. https://arxiv.org/abs/2402.19070

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