SearcharxivSearch

arXiv · 2503.10543

A large multi-agent system with noise both in position and control

Abstract

In this work, we consider a multi-population system where the dynamics of each agent evolve according to a system of stochastic differential equations in a general functional setup, determined by the global state of the system. Each agent is associated with a probability measure, that assigns the label accounting for the population to which the agent belongs. We do not assume any prior knowledge of the label of a single agent, and we allow that it can change as a consequence of the interaction among the agents. Furthermore, the system is affected by noise both in the agent's position and labels. First, we study the well-posedness of such a system and then a mean-field limit, as the number of agents diverges, is investigated together with the analysis of the properties of the limit distribution both with Eulerian and Lagrangian perspectives. As an application, we consider a large network of interacting neurons with random synaptic weights, introducing resets in the dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Giuseppe D'Onofrio, Anderson Melchor Hernandez. 2025-03-13. A large multi-agent system with noise both in position and control. https://arxiv.org/abs/2503.10543

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