The reliability of recurrence network analysis is influenced by the observability properties of the recorded time series
Carregando...
Data
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Minas Gerais
Descrição
Tipo
Artigo de periódico
Título alternativo
Primeiro orientador
Membros da banca
Resumo
Recurrence network analysis (RNA) is a remarkable technique for the detection of dynamical transitions in experimental applications. However, in practical experiments, often only a scalar time series is recorded. This requires the state-space reconstruction from this single time series which, as established by embedding and observability theory, is shown to be hampered if the recorded variable conveys poor observability. In this work, we investigate how RNA metrics are impacted by the observability properties of the recorded time series. Following the framework of Zou et al. [Chaos 20, 043130 (2010)], we use the Rössler and Duffing-Ueda systems as benchmark models for our study. It is shown that usually RNA metrics perform badly with variables of poor observability as for recurrence quantification analysis. An exception is the clustering coefficient, which is rather robust to observability issues. Along with its efficacy to detect dynamical transitions, it is shown to be an efficient tool for RNA-especially when no prior information of the variable observability is available.
Abstract
Assunto
Sistemas não lineares
Palavras-chave
Lyapunov exponent, Nonlinear systems, Dynamical systems, Chaotic regime, Network analysis, Time series analysis
Citação
Departamento
Curso
Endereço externo
https://pubs.aip.org/aip/cha/article/29/8/083101/1058576/The-reliability-of-recurrence-network-analysis-is