SearcharxivSearch

arXiv · 0809.4947

Stochastic vortex method for forced three-dimensional Navier--Stokes equations and pathwise convergence rate

Abstract

We develop a McKean-Vlasov interpretation of Navier-Stokes equations with external force field in the whole space, by associating with local mild $L^p$-solutions of the 3d-vortex equation a generalized nonlinear diffusion with random space-time birth that probabilistically describes creation of rotation in the fluid due to nonconservativeness of the force. We establish a local well-posedness result for this process and a stochastic representation formula for the vorticity in terms of a vector-weighted version of its law after its birth instant. Then we introduce a stochastic system of 3d vortices with mollified interaction and random space-time births, and prove the propagation of chaos property, with the nonlinear process as limit, at an explicit pathwise convergence rate. Convergence rates for stochastic approximation schemes of the velocity and the vorticity fields are also obtained. We thus extend and refine previous results on the probabilistic interpretation and stochastic approximation methods for the nonforced equation, generalizing also a recently introduced random space-time-birth particle method for the 2d-Navier-Stokes equation with force.

Explore related subjects

Keep this discovery

BibTeXRIS

J. Fontbona. 2008-09-29. Stochastic vortex method for forced three-dimensional Navier--Stokes equations and pathwise convergence rate. https://doi.org/10.1214/09-aap672

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