SearcharxivSearch

arXiv · 2005.05624

A Law of Large Numbers for interacting diffusions via a mild formulation

Abstract

Consider a system of $n$ weakly interacting particles driven by independent Brownian motions. In many instances, it is well known that the empirical measure converges to the solution of a partial differential equation, usually called McKean-Vlasov or Fokker-Planck equation, as $n$ tends to infinity. We propose a relatively new approach to show this convergence by directly studying the stochastic partial differential equation that the empirical measure satisfies for each fixed $n$. Under a suitable control on the noise term, which appears due to the finiteness of the system, we are able to prove that the stochastic perturbation goes to zero, showing that the limiting measure is a solution to the classical McKean-Vlasov equation. In contrast with known results, we do not require any independence or finite moment assumption on the initial condition, but the only weak convergence. The evolution of the empirical measure is studied in a suitable class of Hilbert spaces where the noise term is controlled using two distinct but complementary techniques: rough paths theory and maximal inequalities for self-normalized processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Florian Bechtold, Fabio Coppini. 2020-05-12. A Law of Large Numbers for interacting diffusions via a mild formulation. https://arxiv.org/abs/2005.05624

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