SearcharxivSearch

arXiv · 2206.13291

Propagation of chaos in mean field networks of FitzHugh-Nagumo neurons

Abstract

In this article, we are interested in the behavior of a fully connected network of $N$ neurons, where $N$ tends to infinity. We assume that the neurons follow the stochastic FitzHugh-Nagumo model, whose specificity is the non-linearity with a cubic term. We prove a result of uniform in time propagation of chaos of this model in a mean-field framework. We also exhibit explicit bounds. We use a coupling method initially suggested by A. Eberle (arXiv:1305.1233), and recently extended in (1805.11387), known as the reflection coupling. We simultaneously construct a solution of the $N$-particle system and $N$ independent copies of the non-linear McKean-Vlasov limit in such a way that, considering an appropriate semi-metric that takes into account the various possible behaviors of the processes, the two solutions tend to get closer together as $N$ increases, uniformly in time. The reflection coupling allows us to deal with the non-convexity of the underlying potential in the dynamics of the quantities defining our network, and show independence at the limit for the system in mean field interaction with sufficiently small Lipschitz continuous interactions.

Explore related subjects

Keep this discovery

BibTeXRIS

Laetitia Colombani, Pierre Le Bris. 2022-06-27. Propagation of chaos in mean field networks of FitzHugh-Nagumo neurons. https://doi.org/10.46298/mna.9748

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