Exact Solutions for Rate and Synchrony in Recurrent Networks of Coincidence Detectors

DOI10.1162/neco.2008.07-07-570zbMath1148.92010OpenAlexW1974479903WikidataQ41873672 ScholiaQ41873672MaRDI QIDQ3536228

Ernst Niebur, Shawn Mikula

Publication date: 20 November 2008

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc2722920

Mathematics Subject Classification ID

Neural biology (92C20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items

Estimating Parameters of Generalized Integrate-and-Fire Neurons from the Maximum Likelihood of Spike Trains

Cites Work

• Detecting higher-order interactions among the spiking events in a group of neurons
• Theory of the Snowflake Plot and Its Relations to Higher-Order Analysis Methods
• Finite Automata, Pattern Recognition and Perceptrons
• Synaptic Depression Leads to Nonmonotonic Frequency Dependence in the Coincidence Detector
• The Effects of Input Rate and Synchrony on a Coincidence Detector: Analytical Solution
• Generation of Synthetic Spike Trains with Defined Pairwise Correlations
• Rate and Synchrony in Feedforward Networks of Coincidence Detectors: Analytical Solution

This page was built for publication: Exact Solutions for Rate and Synchrony in Recurrent Networks of Coincidence Detectors