SearcharxivSearch

arXiv · 2504.12960

A uniform particle approximation to the Navier-Stokes-alpha models in three dimensions with advection noise

Abstract

In this work, we investigate a system of interacting particles governed by a set of stochastic differential equations. Our main goal is to rigorously demonstrate that the empirical measure associated with the particle system converges uniformly, both in time and space, to the solution of the three dimensional Navier Stokes alpha model with advection noise. This convergence establishes a probabilistic framework for deriving macroscopic stochastic fluid equations from underlying microscopic dynamics. The analysis leverages semigroup techniques to address the nonlinear structure of the limiting equations, and we provide a detailed treatment of the well posedness of the limiting stochastic partial differential equation. This ensures that the particle approximation remains stable and controlled over time. Although similar convergence results have been obtained in two dimensional settings, our study presents the first proof of strong uniform convergence in three dimensions for a stochastic fluid model derived from an interacting particle system. Importantly, our results also yield new insights in the deterministic regime, namely, in the absence of advection noise, where this type of convergence had not been previously established.

Explore related subjects

Keep this discovery

BibTeXRIS

Filippo Giovagnini, Dan Crisan. 2025-04-17. A uniform particle approximation to the Navier-Stokes-alpha models in three dimensions with advection noise. https://arxiv.org/abs/2504.12960

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