SearcharxivSearch

arXiv · 2212.08884

Propagation of chaos for topological interactions by a coupling technique

Abstract

We consider a system of particles which interact through a jump process. The jump intensities are functions of the proximity rank of the particles, a type of interaction referred to as topological in the literature. Such interactions have been shown relevant for the modelling of bird flocks. We show that, in the large number of particles limit and under minimal smoothness assumptions on the data, the model converges to a kinetic equation which was derived in earlier works both formally and rigorously under more stringent regularity assumptions. The proof relies on the coupling method which assigns to the particle and limiting processes a joint process posed on the cartesian product of the two configuration spaces of the former processes. By appropriate estimates in a suitable Wasserstein metric, we show that the distance between the two processes tends to zero as the number of particles tends to infinity, with an error typical of the law of large numbers.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Degond, Mario Pulvirenti, Stefano Rossi. 2022-12-17. Propagation of chaos for topological interactions by a coupling technique. https://arxiv.org/abs/2212.08884

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