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

Neural Computation

April 1, 2000, Vol. 12, No. 4, Pages 903-931
(doi: 10.1162/089976600300015646)
© 2000 Massachusetts Institute of Technology
Synthesis of Generalized Algorithms for the Fast Computation of Synaptic Conductances with Markov Kinetic Models in Large Network Simulations
Article PDF (1.13 MB)
Abstract

Markov kinetic models constitute a powerful framework to analyze patch-clamp data from single-channel recordings and model the dynamics of ion conductances and synaptic transmission between neurons. In particular, the accurate simulation of a large number of synaptic inputs in wide-scale network models may result in a computationally highly demanding process. We present a generalized consolidating algorithm to simulate efficiently a large number of synaptic inputs of the same kind (excitatory or inhibitory), converging on an isopotential compartment, independently modeling each synaptic current by a generic n-state Markov model characterized by piece-wise constant transition probabilities. We extend our findings to a class of simplified phenomenological descriptions of synaptic transmission that incorporate higher-order dynamics, such as short-term facilitation, depression, and synaptic plasticity.