2017
DOI: 10.1371/journal.pone.0189853
|View full text |Cite
|
Sign up to set email alerts
|

Hidden early-warning signals in scale-free networks

Abstract: Critical transitions of complex systems can often be predicted by so-called early-warning signals (EWS). In some cases, however, such signals cannot be detected although a critical transition is imminent. Observing a relation of EWS-detectability and the network topology in which the system is implemented, we simulate and investigate scale-free networks and identify which networks show, and which do not show EWS in the framework of a two state system that exhibits critical transitions. Additionally, we adapt o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 40 publications
0
8
0
Order By: Relevance
“…We considered two different network topologies, the one being an average-degree network, with nodes having a uniformly distributed number of links to other nodes. And the other is a scale-free network implemented after the suggestion of Goh et al [39], which, dependent on a parameter varying between 0 and 2 generates networks with a distribution of link degrees obeying a power law P(k) ≈ k − of which the (half of the) average link degree can be determined with a parameter m using the algorithm explained in [40]. In both topologies, the population of P = 1000 particles were differentiated with regard to centrality, taking the fraction with abovemedian centrality as "central" nodes (blue in Fig.…”
Section: Ews-analysis On a Networked Versionmentioning
confidence: 99%
See 1 more Smart Citation
“…We considered two different network topologies, the one being an average-degree network, with nodes having a uniformly distributed number of links to other nodes. And the other is a scale-free network implemented after the suggestion of Goh et al [39], which, dependent on a parameter varying between 0 and 2 generates networks with a distribution of link degrees obeying a power law P(k) ≈ k − of which the (half of the) average link degree can be determined with a parameter m using the algorithm explained in [40]. In both topologies, the population of P = 1000 particles were differentiated with regard to centrality, taking the fraction with abovemedian centrality as "central" nodes (blue in Fig.…”
Section: Ews-analysis On a Networked Versionmentioning
confidence: 99%
“…The application of detrended fluctuation analysis (DFA) and the analysis of spectral reddening (R) is explained in [7] and [40].…”
Section: Coefficient Of Variationmentioning
confidence: 99%
“…A recent study along these directions identified the presence of motifs as a cause for decreased robustness [78]. Another approach is to identify an effective state that carries information on both the topology and state of each node [79].…”
Section: Early Warning Signals For Complex Networkmentioning
confidence: 99%
“…Another major issue that plagues the detection of early warning signals in real data is the prevalence of false negatives and positives. The former can occur due to reasons such as topology effects, under-sampling or insufficient data before the transition [79,168]. The data needs to be sampled with a sampling time lower than the slowest return time in the time series [188,49] since sampling at much longer sampling times causes early warning signals to be missed [168].…”
Section: Issues and False Detections In Ewsmentioning
confidence: 99%
“…Unfortunately, the detection of such EWSs is not always straightforward. Sometimes the signals are hidden or obscured by topological effects [15] or the system shows a total lack of EWSs, despite featuring critical transitions [16]. This is called a false negative, since no signal can be detected, even though a critical transition is immanent.…”
Section: Introductionmentioning
confidence: 99%