SearcharxivSearch

arXiv · 1407.7234

On the Law of Large Numbers for the empirical measure process of Generalized Dyson Brownian motion

Abstract

We study the generalized Dyson Brownian motion (GDBM) of an interacting $N$-particle system with logarithmic Coulomb interaction and general potential $V$. Under reasonable condition on $V$, we prove the existence and uniqueness of strong solution to SDE for GDBM. We then prove that the family of the empirical measures of GDBM is tight on $\mathcal {C}([0,T],\mathscr{P}(\mathbb{R}))$ and all the large $N$ limits satisfy a nonlinear McKean-Vlasov equation. Inspired by previous works due to Biane and Speicher, Carrillo, McCann and Villani, we prove that the McKean-Vlasov equation is indeed the gradient flow of the Voiculescu free entropy on the Wasserstein space of probability measures over $\mathbb{R}$. Using the optimal transportation theory, we prove that if $V"\geq K$ for some constant $K\in \mathbb{R}$, the McKean-Vlasov equation has a unique weak solution. This proves the Law of Large Numbers and the propagation of chaos for the empirical measures of GDBM. Finally, we prove the longtime convergence of the McKean-Vlasov equation for $C^2$-convex potentials $V$.

Explore related subjects

Keep this discovery

BibTeXRIS

Songzi Li, Xiang-Dong Li, Yong-Xiao Xie. 2015-07-29. On the Law of Large Numbers for the empirical measure process of Generalized Dyson Brownian motion. https://arxiv.org/abs/1407.7234

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