Propagation of chaos and Poisson hypothesis for replica mean-field models of intensity-based neural networks

Abstract

Neural computations arising from myriads of interactions between spiking neurons can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this difficulty, the Poisson hypothesis regime replaces interaction times between neurons by Poisson processes. We prove that the Poisson hypothesis holds at the limit of an infinite number of replicas in the replica-mean-field model, which consists of randomly interacting copies of the network of interest. The proof is obtained through a novel application of the Chen–Stein method to the case of a random sum of Bernoulli random variables and a fixed point approach to prove a law of large numbers for exchangeable random variables.