ArticleJournal of computational neuroscience2025
A simplified model of NMDA-receptor-mediated dynamics in leaky integrate-and-fire neurons.
Article in Journal of computational neuroscience, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
A model for NMDA-receptor-mediated synaptic currents in leaky integrate-and-fire neurons, first proposed by Wang (J Neurosci, 1999), has been widely studied in computational neuroscience. The model features a fast rise in the NMDA conductance upon spikes in a pre-synaptic neuron followed by a slow decay. In a general implementation of this model which allows for arbitrary network connectivity and delay distributions, the summed NMDA current from all neurons in a pre-synaptic population cannot be simulated in aggregated form. Simulating each synapse separately is prohibitively slow for all but small networks, which has largely limited the use of the model to fully connected networks with identical delays, for which an efficient simulation scheme exists. We propose an approximation to the original model that can be efficiently simulated for arbitrary network connectivity and delay distributions. Our results demonstrate that the approximation incurs minimal error and preserves network dynamics. We further use the approximate model to explore binary decision making in sparsely coupled networks.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.