Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

January 1, 2003, Vol. 15, No. 1, Pages 143-159
(doi: 10.1162/089976603321043739)
© 2002 Massachusetts Institute of Technology
Determination of Firing Times for the Stochastic Fitzhugh-Nagumo Neuronal Model
Article PDF (260.07 KB)
Abstract

We present for the first time an analytical approach for determining the time of firing of multicomponent nonlinear stochastic neuronal models. We apply the theory of first exit times for Markov processes to the Fitzhugh-Nagumo system with a constant mean gaussian white noise input, representing stochastic excitation and inhibition. Partial differential equations are obtained for the moments of the time to first spike. The observation that the recovery variable barely changes in the prespike trajectory leads to an accurate one-dimensional approximation. For the moments of the time to reach threshold, this leads to ordinary differential equations that may be easily solved. Several analytical approaches are explored that involve perturbation expansions for large and small values of the noise parameter. For ranges of the parameters appropriate for these asymptotic methods, the perturbation solutions are used to establish the validity of the one-dimensional approximation for both small and large values of the noise parameter. Additional verification is obtained with the excellent agreement between the mean and variance of the firing time found by numerical solution of the differential equations for the one-dimensional approximation and those obtained by simulation of the solutions of the model stochastic differential equations. Such agreement extends to intermediate values of the noise parameter. For the mean time to threshold, we find maxima at small noise values that constitute a form of stochastic resonance. We also investigate the dependence of the mean firing time on the initial values of the voltage and recovery variables when the input current has zero mean.