Fast transformation from time series to visibility graphs

DOI10.1063/1.4927835zbMath1374.37105OpenAlexW1895255156WikidataQ50860718 ScholiaQ50860718MaRDI QIDQ4591719

Xin Lan, Hongming Mo, Qi Liu, Yong Deng, Shiyu Chen

Publication date: 17 November 2017

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.4927835

Mathematics Subject Classification ID

Time series analysis of dynamical systems (37M10) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Optimization of mixture models on time series networks encoded by visibility graphs: an analysis of the US electricity market ⋮ A simple scalable linear time algorithm for horizontal visibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complex network approach for recurrence analysis of time series
• Characterizing pseudoperiodic time series through the complex network approach
• A functional approach to external graph algorithms
• From the Cover: The structure of scientific collaboration networks
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• On the degree distribution of horizontal visibility graphs associated with Markov processes and dynamical systems: diagrammatic and variational approaches
• From time series to complex networks: The visibility graph
• Emergence of Scaling in Random Networks
• COMPARISON OF DIFFERENT DAILY STREAMFLOW SERIES IN US AND CHINA, UNDER A VIEWPOINT OF COMPLEX NETWORKS
• Collective dynamics of ‘small-world’ networks
• Horizontal Visibility graphs generated by type-II intermittency

This page was built for publication: Fast transformation from time series to visibility graphs