SearcharxivSearch

arXiv · 2502.20262

Uniform-in-Time Convergence Rates to a Nonlinear Markov Chain for Mean-Field Interacting Jump Processes

Abstract

We consider a system of $N$ particles interacting through their empirical distribution on a finite state space in continuous time. In the formal limit as $N\to\infty$, the system takes the form of a nonlinear (McKean--Vlasov) Markov chain. This paper rigorously establishes this limit. Specifically, under the assumption that the mean field system has a unique, exponentially stable stationary distribution, we show that the weak error between the empirical measures of the $N$-particle system and the law of the mean field system is of order $1/N$ uniformly in time. Our analysis makes use of a master equation for test functions evaluated along the measure flow of the mean field system, and we demonstrate that the solutions of this master equation are sufficiently regular. We then show that exponential stability of the mean field system is implied by exponential stability for solutions of the linearized Kolmogorov equation with a source term. Finally, we show that our results can be applied to the study of mean field games and give a new condition for the existence of a unique stationary distribution for a nonlinear Markov chain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Asaf Cohen, Ethan Huffman. 2025-02-27. Uniform-in-Time Convergence Rates to a Nonlinear Markov Chain for Mean-Field Interacting Jump Processes. https://arxiv.org/abs/2502.20262

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