2019
DOI: 10.1103/physreve.100.052211
|View full text |Cite
|
Sign up to set email alerts
|

Noise-induced macroscopic oscillations in a network of synaptically coupled quadratic integrate-and-fire neurons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2019
2019
2025
2025

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(32 citation statements)
references
References 46 publications
0
32
0
Order By: Relevance
“…Nonetheless, similarly to the case of linear variables, where for non-Gaussian cases one can benefit from corrections owned by a finite number of higher-order cumulants, closures with more than one circular cumulant are useful. We also show that in some physical systems the macroscopic variables driving collective dynamics (e.g., neuron firing rate [28,[31][32][33][34][35]) can depend on the Kuramoto-Daido order parameters in such a way that a careless representation of these variables in terms of circular cumulants can be always diverging. Further, we discuss how the issue of approximations with a finite number of circular cumulants should be handled in a regular way in the cases where the cumulants form a decaying geometric progression.…”
Section: Introductionmentioning
confidence: 89%
See 1 more Smart Citation
“…Nonetheless, similarly to the case of linear variables, where for non-Gaussian cases one can benefit from corrections owned by a finite number of higher-order cumulants, closures with more than one circular cumulant are useful. We also show that in some physical systems the macroscopic variables driving collective dynamics (e.g., neuron firing rate [28,[31][32][33][34][35]) can depend on the Kuramoto-Daido order parameters in such a way that a careless representation of these variables in terms of circular cumulants can be always diverging. Further, we discuss how the issue of approximations with a finite number of circular cumulants should be handled in a regular way in the cases where the cumulants form a decaying geometric progression.…”
Section: Introductionmentioning
confidence: 89%
“…In [20,21], corrections owned by the second cumulant allowed to achieve accurate results where the OA ansatz was significantly inaccurate. The cumulant approach can be also applicable for a theoretical analysis of the non-OA situations, e.g., in [24][25][26][27][28][29].…”
Section: Introductionmentioning
confidence: 99%
“…Low dimensional rate models able to capture the synchronization dynamics of spiking networks have been recently introduced [48,49], but they are usually limited to homogenous populations. MF formulations for heterogeneous networks subject to extrinsic noise sources have been examined in the context of the circular cumulants expansion [40,[49][50][51]. However, as noticed in [51], this expansion has the drawback that any finite truncation leads to a divergence of the population firing rate.…”
Section: (C) and (D))mentioning
confidence: 99%
“…This approach is based on the expansion of the characteristic function in terms of pseudo-cumulants , thus avoiding the divergences related to the expansion in conventional moments or cumulants. The implementation and benefits of this formulation are demonstrated for heterogenous populations of QIF neurons in presence of extrinsic and endogenous noise sources, where the conditions for a LD of the membrane potentials [21] are violated as in [44, 45]. In particular, we will derive a hierarchy of low-dimensional MF models for noisy globally coupled populations and deterministic sparse random networks, with a particular emphasis on the emergence of fluctuation driven collective oscillations (COs).…”
Section: Introductionmentioning
confidence: 99%
“…One of the characteristic properties of these mean-field models is the ability to exactly describing the network dynamics but not approximately reduce the network. Thus, the mean-field model derived by these methods can obtain the exact dynamical mechanism of the network models [25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%