SearcharxivSearch

arXiv · 2512.12861

Ergodicity for the Dean--Kawasaki Equation with Dirichlet Boundary Conditions: Taming the Square-Root

Abstract

In this paper, we establish the ergodicity of generalized Dean--Kawasaki equations with correlated noise and Dirichlet boundary conditions. In contrast to the ergodicity results of Fehrman, Gess, and Gvalani arXiv:2206.14789, our analysis accommodates irregular, square-root type noise coefficients. For such irregular coefficients, we prove that the law of the classical Dean--Kawasaki equation converges exponentially fast to equilibrium, while for the porous medium type Dean--Kawasaki equation, the convergence occurs at a polynomial rate. Furthermore, we obtain a regularization by noise effect, showing that the polynomial convergence rate improves to an exponential one whenever the noise coefficient is sufficiently regular, including the case of conservative multiplicative linear noise. Our approach relies on establishing a supercontraction property in a suitably weighted Lebesgue space, achieved through a refined doubling of variables argument. The construction of the weight function crucially exploits the specific structure of the Dean--Kawasaki-type correlated noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shyam Popat, Zhengyan Wu. 2025-12-14. Ergodicity for the Dean--Kawasaki Equation with Dirichlet Boundary Conditions: Taming the Square-Root. https://arxiv.org/abs/2512.12861

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