SearcharxivSearch

arXiv · 2505.18481

The Kinetic Limit of Balanced Neural Networks

Abstract

The theory of Balanced Neural Networks is a very popular explanation for the high degree of variability and stochasticity in the brain's activity. Roughly speaking, it entails that typical neurons receive many excitatory and inhibitory inputs. The network-wide mean inputs cancel, and one is left with the stochastic fluctuations about the mean. In this paper we determine kinetic equations that describe the population density. The intrinsic dynamics is nonlinear, with multiplicative noise perturbing the state of each neuron. The equations have a spatial dimension, such that the strength-of-connection between neurons is a function of their spatial position. Our method of proof is to decompose the state variables into (i) the network-wide average activity, and (ii) fluctuations about this mean. In the limit, we determine two coupled limiting equations. The requirement that the system be balanced yields implicit equations for the evolution of the average activity. In the large n limit, the population density of the fluctuations evolves according to a Fokker-Planck equation. If one makes an additional assumption that the intrinsic dynamics is linear and the noise is not multiplicative, then one obtains a spatially-distributed neural field equation.

Explore related subjects

Keep this discovery

BibTeXRIS

James MacLaurin, Pedro Vilanova. 2025-05-24. The Kinetic Limit of Balanced Neural Networks. https://arxiv.org/abs/2505.18481

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