SearcharxivSearch

arXiv · 2111.05213

Strong error bounds for the convergence to its mean field limit for systems of interacting neurons in a diffusive scaling

Abstract

We consider the stochastic system of interacting neurons introduced in De Masi et al. (2015) and in Fournier and L\"ocherbach (2016) and then further studied in Erny, L\"ocherbach and Loukianova (2021) in a diffusive scaling. The system consists of N neurons, each spiking randomly with rate depending on its membrane potential. At its spiking time, the potential of the spiking neuron is reset to 0 and all other neurons receive an additional amount of potential which is a centred random variable of order $ 1 / \sqrt{N}.$ In between successive spikes, each neuron's potential follows a deterministic flow. In a previous article we proved the convergence of the system, as $N \to \infty$, to a limit nonlinear jumping stochastic differential equation. In the present article we complete this study by establishing a strong convergence result, stated with respect to an appropriate distance, with an explicit rate of convergence. The main technical ingredient of our proof is the coupling introduced in Koml\'os, Major and Tusn\'ady (1976) of the point process representing the small jumps of the particle system with the limit Brownian motion

Explore related subjects

Keep this discovery

BibTeXRIS

Xavier Erny, Eva Löcherbach, Dasha Loukianova. 2021-11-09. Strong error bounds for the convergence to its mean field limit for systems of interacting neurons in a diffusive scaling. https://arxiv.org/abs/2111.05213

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