SearcharxivSearch

arXiv · 1208.6422

Weak Convergence of $n$-Particle Systems Using Bilinear Forms

Abstract

The paper is concerned with the weak convergence of $n$-particle processes to deterministic stationary paths as $n\to\infty$. A Mosco type convergence of a class of bilinear forms is introduced. The Mosco type convergence of bilinear forms results in a certain convergence of the resolvents of the $n$-particle systems. Based on this convergence a criterion in order to verify weak convergence of invariant measures is established. Under additional conditions weak convergence of stationary $n$-particle processes to stationary deterministic paths is proved. The method is applied to the particle approximation of a Ginzburg-Landau type diffusion. The present paper is in close relation to the paper Löbus (2011/2012). Different definitions of bilinear forms and versions of Mosco type convergence are introduced. Both papers demonstrate that the choice of the form and the type of convergence relates to the particular particle system.

Explore related subjects

Keep this discovery

BibTeXRIS

Jörg-Uwe Löbus. 2013-03-13. Weak Convergence of $n$-Particle Systems Using Bilinear Forms. https://arxiv.org/abs/1208.6422

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