2017
DOI: 10.1038/srep42340
|View full text |Cite
|
Sign up to set email alerts
|

Topological determinants of self-sustained activity in a simple model of excitable dynamics on graphs

Abstract: Simple models of excitable dynamics on graphs are an efficient framework for studying the interplay between network topology and dynamics. This topic is of practical relevance to diverse fields, ranging from neuroscience to engineering. Here we analyze how a single excitation propagates through a random network as a function of the excitation threshold, that is, the relative amount of activity in the neighborhood required for the excitation of a node. We observe that two sharp transitions delineate a region of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
17
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
4
1
1

Relationship

4
2

Authors

Journals

citations
Cited by 14 publications
(18 citation statements)
references
References 51 publications
1
17
0
Order By: Relevance
“…Both correctly predicts the exchange of stability between the non-trivial fixed point and the value c o E = f corresponding to the extinction of excitation propagation. We have shown in [11] that a sustained activity (corresponding to the non trivial steady state) occurs up to a value κ m that can be roughly estimated from the graph topology as the maximal degree k max of the graph, in agreement with the upper bound 1/ k (larger that 1/k max ) predicted here using mean-field analysis. The observed lower bound c * E can be explained as a fluctuation effect: the actual number of excited neighbors of a node of degree k can be higher than kc * E , which accommodates excitation propagation for relative threshold values higher than κ = c * E .…”
Section: Pair-correlation Equationssupporting
confidence: 86%
“…Both correctly predicts the exchange of stability between the non-trivial fixed point and the value c o E = f corresponding to the extinction of excitation propagation. We have shown in [11] that a sustained activity (corresponding to the non trivial steady state) occurs up to a value κ m that can be roughly estimated from the graph topology as the maximal degree k max of the graph, in agreement with the upper bound 1/ k (larger that 1/k max ) predicted here using mean-field analysis. The observed lower bound c * E can be explained as a fluctuation effect: the actual number of excited neighbors of a node of degree k can be higher than kc * E , which accommodates excitation propagation for relative threshold values higher than κ = c * E .…”
Section: Pair-correlation Equationssupporting
confidence: 86%
“…Sensory systems for example have an axis along the hierarchical depth from the input nodes to processing nodes generating ever more abstract representations of the sensory input. 51,52 The same is true for manufacturing systems with their hierarchy of input, production and assembly/output layers. 53 The situation we face in our attempts to epitomize the spatiotemporal constraints imposed on the emergence of gene expression patterns is reminicent of the work by Brockmann and Helbing 54 on the spread of epidemic diseases.…”
Section: Discussionmentioning
confidence: 96%
“…61) or relative thresholds (a certain percentage of neighbors needs to be active to trigger an excitation; ref. 25) can also be explored. It seems intuitive, for example, that in relative threshold models, the contribution from the degree gradient will be less important.…”
Section: Resultsmentioning
confidence: 99%