Open Access
February 2019 Estimating the interaction graph of stochastic neural dynamics
Aline Duarte, Antonio Galves, Eva Löcherbach, Guilherme Ost
Bernoulli 25(1): 771-792 (February 2019). DOI: 10.3150/17-BEJ1006


In this paper, we address the question of statistical model selection for a class of stochastic models of biological neural nets. Models in this class are systems of interacting chains with memory of variable length. Each chain describes the activity of a single neuron, indicating whether it spikes or not at a given time. The spiking probability of a given neuron depends on the time evolution of its presynaptic neurons since its last spike time. When a neuron spikes, its potential is reset to a resting level and postsynaptic current pulses are generated, modifying the membrane potential of all its postsynaptic neurons. The relationship between a neuron and its pre- and postsynaptic neurons defines an oriented graph, the interaction graph of the model. The goal of this paper is to estimate this graph based on the observation of the spike activity of a finite set of neurons over a finite time. We provide explicit exponential upper bounds for the probabilities of under- and overestimating the interaction graph restricted to the observed set and obtain the strong consistency of the estimator. Our result does not require stationarity nor uniqueness of the invariant measure of the process.


Download Citation

Aline Duarte. Antonio Galves. Eva Löcherbach. Guilherme Ost. "Estimating the interaction graph of stochastic neural dynamics." Bernoulli 25 (1) 771 - 792, February 2019.


Received: 1 April 2016; Revised: 1 June 2017; Published: February 2019
First available in Project Euclid: 12 December 2018

zbMATH: 07007224
MathSciNet: MR3892336
Digital Object Identifier: 10.3150/17-BEJ1006

Keywords: Biological neural nets , graph of interactions , interacting chains of variable memory length , statistical model selection

Rights: Copyright © 2019 Bernoulli Society for Mathematical Statistics and Probability

Vol.25 • No. 1 • February 2019
Back to Top