SearcharxivSearch

arXiv · 1501.01802

Propagation of chaos for the Landau equation with moderately soft potentials

Abstract

We consider the 3D Landau equation for moderately soft potentials ($\gamma\in(-2,0)$ with the usual notation) as well as a stochastic system of $N$ particles approximating it. We first establish some strong/weak stability estimates for the Landau equation, which are satisfying only when $\gamma \in [-1,0)$. We next prove, under some appropriate conditions on the initial data, the so-called propagation of molecular chaos, i.e. that the empirical measure of the particle system converges to the unique solution of the Landau equation. The main difficulty is the presence of a singularity in the equation. When $\gamma \in (-1,0)$, the strong-weak uniqueness estimate allows us to use a coupling argument and to obtain a rate of convergence. When $\gamma \in (-2,-1]$, we use the classical martingale method introduced by McKean. To control the singularity, we have to take advantage of the regularity provided by the entropy dissipation. Unfortunately, this dissipation is too weak for some (very rare) aligned configurations. We thus introduce a perturbed system with an additional noise, show the propagation of chaos for that perturbed system and finally prove that the additional noise is almost never used in the limit.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Fournier, Maxime Hauray. 2015-01-08. Propagation of chaos for the Landau equation with moderately soft potentials. https://arxiv.org/abs/1501.01802

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