SearcharxivSearch

arXiv · 2408.14290

Universality of the mean-field equations of networks of Hopfield-like neurons

Abstract

We revisit the problem of characterising the mean-field limit of a network of Hopfield-like neurons. Building on the previous works of Ben Arous and Guionnet we establish for a large class of networks of Hopfield-like neurons, i.e. rate neurons, the mean-field equations on a time interval $[0,\,T]$, $T>0$, of the thermodynamic limit of these networks, i.e. the limit when the number of neurons goes to infinity. Here, we do not assume that the synaptic weights describing the connections between the neurons are i.i.d. as zero-mean Gaussians. The limit equations are stochastic and very simply described in terms of two functions, a ``correlation'' function noted $K_Q(t,\,s)$ and a ``mean'' function noted $m_Q(t)$. The ``noise'' part of the equations is a linear function of the Brownian motion, which is obtained by solving a Volterra equation of the second kind whose resolving kernel is expressed as a function of $K_Q$. We give a constructive proof of the uniqueness of the limit equations. We use the corresponding algorithm for an effective computation of the functions $K_Q$ and $m_Q$, given the weights distribution. Several numerical experiments are reported.

Explore related subjects

Keep this discovery

BibTeXRIS

Olivier Faugeras, Etienne Tanré. 2024-08-26. Universality of the mean-field equations of networks of Hopfield-like neurons. https://doi.org/10.1007/s00285-025-02271-4

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