### Abstract

Population density methods provide promising time-saving alternatives to direct Monte Carlo simulations of neuronal network activity, in which one tracks the state of thousands of individual neurons and synapses. A population density method has been found to be roughly a hundred times faster than direct simulation for various test networks of integrate-and-fire model neurons with instantaneous excitatory and inhibitory post-synaptic conductances. In this method, neurons are grouped into large populations of similar neurons. For each population, one calculates the evolution of a probability density function (PDF) which describes the distribution of neurons over state space. The population firing rate is then given by the total flux of probability across the threshold voltage for firing an action potential. Extending the method beyond instantaneous synapses is necessary for obtaining accurate results, because synaptic kinetics play an important role in network dynamics. Embellishments incorporating more realistic synaptic kinetics for the underlying neuron model increase the dimension of the PDF, which was one-dimensional in the instantaneous synapse case. This increase in dimension causes a substantial increase in computation time to find the exact PDF, decreasing the computational speed advantage of the population density method over direct Monte Carlo simulation. We report here on a one-dimensional model of the PDF for neurons with arbitrary synaptic kinetics. The method is more accurate than the mean-field method in the steady state, where the mean-field approximation works best, and also under dynamic-stimulus conditions. The method is much faster than direct simulations. Limitations of the method are demonstrated, and possible improvements are discussed.

Original language | English (US) |
---|---|

Pages (from-to) | 141-174 |

Number of pages | 34 |

Journal | Network: Computation in Neural Systems |

Volume | 12 |

Issue number | 2 |

DOIs | |

State | Published - May 2001 |

### Fingerprint

### ASJC Scopus subject areas

- Neuroscience(all)

### Cite this

**Population density methods for large-scale modelling of neuronal networks with realistic synaptic kinetics : Cutting the dimension down to size.** / Haskell, Evan; Nykamp, Duane Q.; Tranchina, Daniel.

Research output: Contribution to journal › Article

*Network: Computation in Neural Systems*, vol. 12, no. 2, pp. 141-174. https://doi.org/10.1088/0954-898X/12/2/304

}

TY - JOUR

T1 - Population density methods for large-scale modelling of neuronal networks with realistic synaptic kinetics

T2 - Cutting the dimension down to size

AU - Haskell, Evan

AU - Nykamp, Duane Q.

AU - Tranchina, Daniel

PY - 2001/5

Y1 - 2001/5

N2 - Population density methods provide promising time-saving alternatives to direct Monte Carlo simulations of neuronal network activity, in which one tracks the state of thousands of individual neurons and synapses. A population density method has been found to be roughly a hundred times faster than direct simulation for various test networks of integrate-and-fire model neurons with instantaneous excitatory and inhibitory post-synaptic conductances. In this method, neurons are grouped into large populations of similar neurons. For each population, one calculates the evolution of a probability density function (PDF) which describes the distribution of neurons over state space. The population firing rate is then given by the total flux of probability across the threshold voltage for firing an action potential. Extending the method beyond instantaneous synapses is necessary for obtaining accurate results, because synaptic kinetics play an important role in network dynamics. Embellishments incorporating more realistic synaptic kinetics for the underlying neuron model increase the dimension of the PDF, which was one-dimensional in the instantaneous synapse case. This increase in dimension causes a substantial increase in computation time to find the exact PDF, decreasing the computational speed advantage of the population density method over direct Monte Carlo simulation. We report here on a one-dimensional model of the PDF for neurons with arbitrary synaptic kinetics. The method is more accurate than the mean-field method in the steady state, where the mean-field approximation works best, and also under dynamic-stimulus conditions. The method is much faster than direct simulations. Limitations of the method are demonstrated, and possible improvements are discussed.

AB - Population density methods provide promising time-saving alternatives to direct Monte Carlo simulations of neuronal network activity, in which one tracks the state of thousands of individual neurons and synapses. A population density method has been found to be roughly a hundred times faster than direct simulation for various test networks of integrate-and-fire model neurons with instantaneous excitatory and inhibitory post-synaptic conductances. In this method, neurons are grouped into large populations of similar neurons. For each population, one calculates the evolution of a probability density function (PDF) which describes the distribution of neurons over state space. The population firing rate is then given by the total flux of probability across the threshold voltage for firing an action potential. Extending the method beyond instantaneous synapses is necessary for obtaining accurate results, because synaptic kinetics play an important role in network dynamics. Embellishments incorporating more realistic synaptic kinetics for the underlying neuron model increase the dimension of the PDF, which was one-dimensional in the instantaneous synapse case. This increase in dimension causes a substantial increase in computation time to find the exact PDF, decreasing the computational speed advantage of the population density method over direct Monte Carlo simulation. We report here on a one-dimensional model of the PDF for neurons with arbitrary synaptic kinetics. The method is more accurate than the mean-field method in the steady state, where the mean-field approximation works best, and also under dynamic-stimulus conditions. The method is much faster than direct simulations. Limitations of the method are demonstrated, and possible improvements are discussed.

UR - http://www.scopus.com/inward/record.url?scp=0042736230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042736230&partnerID=8YFLogxK

U2 - 10.1088/0954-898X/12/2/304

DO - 10.1088/0954-898X/12/2/304

M3 - Article

C2 - 11405420

AN - SCOPUS:0042736230

VL - 12

SP - 141

EP - 174

JO - Network: Computation in Neural Systems

JF - Network: Computation in Neural Systems

SN - 0954-898X

IS - 2

ER -