SearcharxivSearch

arXiv · math/0408372

Asymptotic analysis of a particle system with mean-field interaction

Abstract

We study a system of $N$ interacting particles on $\bf{Z}$. The stochastic dynamics consists of two components: a free motion of each particle (independent random walks) and a pair-wise interaction between particles. The interaction belongs to the class of mean-field interactions and models a rollback synchronization in asynchronous networks of processors for a distributed simulation. First of all we study an empirical measure generated by the particle configuration on $\bf{R}$. We prove that if space, time and a parameter of the interaction are appropriately scaled (hydrodynamical scale), then the empirical measure converges weakly to a deterministic limit as $N$ goes to infinity. The limit process is defined as a weak solution of some partial differential equation. We also study the long time evolution of the particle system with fixed number of particles. The Markov chain formed by individual positions of the particles is not ergodic. Nevertheless it is possible to introduce relative coordinates and to prove that the new Markov chain is ergodic while the system as a whole moves with an asymptotically constant mean speed which differs from the mean drift of the free particle motion.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Manita, V. Shcherbakov. 2004-08-26. Asymptotic analysis of a particle system with mean-field interaction. https://arxiv.org/abs/math/0408372

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