On Stationary Distributions of Stochastic Neural Networks. (30th January 2018)

• Record Type: Journal Article
• Authors: Borovkov, K.; Decrouez, G.; Gilson, M.
• Is Part Of: Journal of applied probability. Volume 51:Number 3(2014)
• Page Start: 837
• Page End: 857
• Publication Date: 2018-01-30
• Subjects: Neural network, -- nonlinear Poisson neuron, -- Markov process, -- ergodicity, -- stationary distribution; 60J25, -- 92B20, -- 60J99; 519.2
• DOI: 10.1239/jap/1409932677
• Languages: English
• ISSNs: 0021-9002

Abstract

Abstract : The paper deals with nonlinear Poisson neuron network models with bounded memory dynamics, which can include both Hebbian learning mechanisms and refractory periods. The state of the network is described by the times elapsed since its neurons fired within the post-synaptic transfer kernel memory span, and the current strengths of synaptic connections, the state spaces of our models being hierarchies of finite-dimensional components. We prove the ergodicity of the stochastic processes describing the behaviour of the networks, establish the existence of continuously differentiable stationary distribution densities (with respect to the Lebesgue measures of corresponding dimensionality) on the components of the state space, and find upper bounds for them. For the density components, we derive a system of differential equations that can be solved in a few simplest cases only. Approaches to approximate computation of the stationary density are discussed. One approach is to reduce the dimensionality of the problem by modifying the network so that each neuron cannot fire if the number of spikes it emitted within the post-synaptic transfer kernel memory span reaches a given threshold. We show that the stationary distribution of this 'truncated' network converges to that of the unrestricted network as the threshold increases, and that the convergence is at a superexponential rate. A complementary approach uses discrete Markov chain approximations to the network process.