SearcharxivSearch

arXiv · 2010.08790

Averaging Principles for Markovian Models of Plasticity

Abstract

Mathematical models of biological neural networks are associated to a rich and complex class of stochastic processes. In this paper, we consider a simple {\em plastic} neural network whose {\em connectivity/synaptic strength} $(W(t))$ depends on a set of activity-dependent processes to model {\em synaptic plasticity}, a well-studied mechanism from neuroscience. A general class of stochastic models has been introduced in \cite{robert_mathematical_2020} to study the stochastic process $(W(t))$. It has been observed experimentally that its dynamics occur on much slower timescale than that of the main cellular processes. The purpose of this paper is to establish limit theorems for the distribution of $(W(t))$ with respect to the fast timescale of neuronal processes. The central result of the paper is an averaging principle for the stochastic process $(W(t))$. Mathematically, the key variable is the point process whose jumps occur at the instants of neuronal spikes. A thorough analysis of several of its unbounded additive functionals is achieved in the slow-fast limit. Additionally, technical results on interacting shot-noise processes are developed and used in the general proof of the averaging principle.

Explore related subjects

Keep this discovery

BibTeXRIS

Philippe Robert, Gaetan Vignoud. 2020-10-17. Averaging Principles for Markovian Models of Plasticity. https://doi.org/10.1007/s10955-021-02785-3

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