Explore the vast range of titles available.

We here investigate the well-posedness of a networked integrate-and-fire model describing an infinite population of neurons which interact with one another through their common statistical distribution. The interaction is of the self-excitatory type as, at any time, the potential of a neuron increases when some of the others fire: precisely, the kick it receives is proportional to the instantaneous proportion of firing neurons at the same time. From a mathematical point of view, the coefficient of proportionality, denoted by α, is of great importance as the resulting system is known to blow-up for large values of α. In the current paper, we focus on the complementary regime and prove that existence and uniqueness hold for all time when α is small enough.

Recent investigations of traumatic brain injuries have shown that these injuries can result in conformational changes at the level of individual neurons in the cerebral cortex. Focal axonal swelling is one consequence of such injuries and leads to a variable width along the cell axon. Simulations of the electrical properties of axons impacted in such a way show that this damage may have a nonlinear deleterious effect on spike-encoded signal transmission. The computational cost of these simulations complicates the investigation of the effects of such damage at a network level. We have developed an efficient algorithm that faithfully reproduces the spike train filtering properties seen in physical simulations. We use this algorithm to explore the impact of focal axonal swelling on small networks of integrate and fire neurons. We explore also the effects of architecture modifications to networks impacted in this manner. In all tested networks, our results indicate that the addition of presynaptic inhibitory neurons either increases or leaves unchanged the fidelity, in terms of bandwidth, of the network’s processing properties with respect to this damage.

Despite the widespread use of EEGs to measure the large-scale dynamics of the human brain, little is known on how the dynamics of EEGs relates to that of the underlying spike rates of cortical neurons. However, progress was made by recent neurophysiological experiments reporting that EEG delta-band phase and gamma-band amplitude reliably predict some complementary aspects of the time course of spikes of visual cortical neurons. To elucidate the mechanisms behind these findings, here we hypothesize that the EEG delta phase reflects shifts of local cortical excitability arising from slow fluctuations in the network input due to entrainment to sensory stimuli or to fluctuations in ongoing activity, and that the resulting local excitability fluctuations modulate both the spike rate and the engagement of excitatory–inhibitory loops producing gamma-band oscillations. We quantitatively tested these hypotheses by simulating a recurrent network of excitatory and inhibitory neurons stimulated with dynamic inputs presenting temporal regularities similar to that of thalamic responses during naturalistic visual stimulation and during spontaneous activity. The network model reproduced in detail the experimental relationships between spike rate and EEGs, and suggested that the complementariness of the prediction of spike rates obtained from EEG delta phase or gamma amplitude arises from nonlinearities in the engagement of excitatory–inhibitory loops and from temporal modulations in the amplitude of the network input, which respectively limit the predictability of spike rates from gamma amplitude or delta phase alone. The model suggested also ways to improve and extend current algorithms for online prediction of spike rates from EEGs.

Reconstructing the recurrent structural connectivity of neuronal networks is a challenge crucial to address in characterizing neuronal computations. While directly measuring the detailed connectivity structure is generally prohibitive for large networks, we develop a novel framework for reverse-engineering large-scale recurrent network connectivity matrices from neuronal dynamics by utilizing the widespread sparsity of neuronal connections. We derive a linear input-output mapping that underlies the irregular dynamics of a model network composed of both excitatory and inhibitory integrate-and-fire neurons with pulse coupling, thereby relating network inputs to evoked neuronal activity. Using this embedded mapping and experimentally feasible measurements of the firing rate as well as voltage dynamics in response to a relatively small ensemble of random input stimuli, we efficiently reconstruct the recurrent network connectivity via compressive sensing techniques. Through analogous analysis, we then recover high dimensional natural stimuli from evoked neuronal network dynamics over a short time horizon. This work provides a generalizable methodology for rapidly recovering sparse neuronal network data and underlines the natural role of sparsity in facilitating the efficient encoding of network data in neuronal dynamics.

It is shown that memcapacitive (memory capacitive) systems can be used as synapses in artificial neural networks. As an example of the proposed approach, the architecture of an integrate-and-fire neural network based on memcapacitive synapses is discussed. Moreover, it has been demonstrated that the spike-timing-dependent plasticity can be simply realised with some of these devices. Memcapacitive synapses are a low-energy alternative to memristive synapses for neuromorphic computation.

In order to properly capture spike-frequency adaptation with a simplified point-neuron model, we study approximations of Hodgkin-Huxley (HH) models including slow currents by exponential integrate-and-fire (EIF) models that incorporate the same types of currents. We optimize the parameters of the EIF models under the external drive consisting of AMPA-type conductance pulses using the current-voltage curves and the van Rossum metric to best capture the subthreshold membrane potential, firing rate, and jump size of the slow current at the neuron’s spike times. Our numerical simulations demonstrate that, in addition to these quantities, the approximate EIF-type models faithfully reproduce bifurcation properties of the HH neurons with slow currents, which include spike-frequency adaptation, phase-response curves, critical exponents at the transition between a finite and infinite number of spikes with increasing constant external drive, and bifurcation diagrams of interspike intervals in time-periodically forced models. Dynamics of networks of HH neurons with slow currents can also be approximated by corresponding EIF-type networks, with the approximation being at least statistically accurate over a broad range of Poisson rates of the external drive. For the form of external drive resembling realistic, AMPA-like synaptic conductance response to incoming action potentials, the EIF model affords great savings of computation time as compared with the corresponding HH-type model. Our work shows that the EIF model with additional slow currents is well suited for use in large-scale, point-neuron models in which spike-frequency adaptation is important.

Local field potentials (LFP) and multi-unit activity (MUA) recorded in vivo are known to convey different information about the underlying neural activity. Here we extend and support the idea that single-electrode LFP-MUA task-related modulations can shed light on the involved large-scale, multi-modular neural dynamics. We first illustrate a theoretical scheme and associated simulation evidence, proposing that in a multi-modular neural architecture local and distributed dynamic properties can be extracted from the local spiking activity of one pool of neurons in the network. From this new perspective, the spectral features of the field potentials reflect the time structure of the ongoing fluctuations of the probed local neuronal pool on a wide frequency range. We then report results obtained recording from the dorsal premotor (PMd) cortex of monkeys performing a countermanding task, in which a reaching movement is performed, unless a visual stop signal is presented. We find that the LFP and MUA spectral components on a wide frequency band (3–2000 Hz) are very differently modulated in time for successful reaching, successful and wrong stop trials, suggesting an interplay of local and distributed components of the underlying neural activity in different periods of the trials and for different behavioural outcomes. Besides, the MUA spectral power is shown to possess a time-dependent structure, which we suggest could help in understanding the successive involvement of different local neuronal populations. Finally, we compare signals recorded from PMd and dorso-lateral prefrontal (PFCd) cortex in the same experiment, and speculate that the comparative time-dependent spectral analysis of LFP and MUA can help reveal patterns of functional connectivity in the brain.

Randomly connected populations of spiking neurons display a rich variety of dynamics. However, much of the current modeling and theoretical work has focused on two dynamical extremes: on one hand homogeneous dynamics characterized by weak correlations between neurons, and on the other hand total synchrony characterized by large populations firing in unison. In this paper we address the conceptual issue of how to mathematically characterize the partially synchronous “multiple firing events” (MFEs) which manifest in between these two dynamical extremes. We further develop a geometric method for obtaining the distribution of magnitudes of these MFEs by recasting the cascading firing event process as a first-passage time problem, and deriving an analytical approximation of the first passage time density valid for large neuron populations. Thus, we establish a direct link between the voltage distributions of excitatory and inhibitory neurons and the number of neurons firing in an MFE that can be easily integrated into population–based computational methods, thereby bridging the gap between homogeneous firing regimes and total synchrony.

We study the global dynamics of integrate and fire neural networks composed of an arbitrary number of identical neurons interacting by inhibition and excitation. We prove that if the interactions are strong enough, then the support of the stable asymptotic dynamics consists of limit cycles. We also find sufficient conditions for the synchronization of networks containing excitatory neurons. The proofs are based on the analysis of the equivalent dynamics of a piecewise continuous Poincaré map associated to the system. We show that for efficient interactions the Poincaré map is piecewise contractive. Using this contraction property, we prove that there exist a countable number of limit cycles attracting all the orbits dropping into the stable subset of the phase space. This result applies not only to the Poincaré map under study, but also to a wide class of general n -dimensional piecewise contractive maps.

To avoid the numerical errors associated with resetting the potential following a spike in simulations of integrate-and-fire neuronal networks, Hansel et al. and Shelley independently developed a modified time-stepping method. Their particular scheme consists of second-order Runge-Kutta time-stepping, a linear interpolant to find spike times, and a recalibration of postspike potential using the spike times. Here we show analytically that such a scheme is second order, discuss the conditions under which efficient, higher-order algorithms can be constructed to treat resets, and develop a modified fourth-order scheme. To support our analysis, we simulate a system of integrate-and-fire conductance-based point neurons with all-to-all coupling. For six-digit accuracy, our modified Runge-Kutta fourth-order scheme needs a time-step of Delta(t) = 0.5 x 10(-3) seconds, whereas to achieve comparable accuracy using a recalibrated second-order or a first-order algorithm requires time-steps of 10(-5) seconds or 10(-9) seconds, respectively. Furthermore, since the cortico-cortical conductances in standard integrate-and-fire neuronal networks do not depend on the value of the membrane potential, we can attain fourth-order accuracy with computational costs normally associated with second-order schemes.