From time series to complex networks: the visibility graph

Abstract

In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series convert into regular graphs, and random series do so into random graphs. Moreover, fractal series convert into scale-free networks, enhancing the fact that power law degree distributions are related to fractality, something highly discussed recently. Some remarkable examples and analytical tools are outlined in order to test the method's reliability. Many different measures, recently developed in the complex network theory, could by means of this new approach characterize time series from a new point of view.

References in corpus (1)

• Fractality in complex networks: critical and supercritical skeletons

Cited by in corpus (20)

• Complex Network Approach for Recurrence Analysis of Time Series
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• Ambiguities in recurrence-based complex network representations of time series
• Analytical framework for recurrence-network analysis of time series
• Degree distribution of the visibility graphs mapped from fractional Brownian motions and multifractal random walks
• Geometric detection of coupling directions by means of inter-system recurrence networks
• Complex network based techniques to identify extreme events and (sudden) transitions in spatio-temporal systems
• Statistical properties of world investment networks
• Networks of motifs from sequences of symbols
• Quantifying sudden changes in dynamical systems using symbolic networks
• Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions
• Fractal and complex network analyses of protein molecular dynamics
• The dynamics of laser droplet generation
• Studying complex tourism systems: a novel approach based on networks derived from a time series
• Geometric and dynamic perspectives on phase-coherent and noncoherent chaos
• Contact graphs of disk packings as a model of spatial planar networks
• Planar Visibility Graph Network Algorithm For Two Dimensional Timeseries
• Randomness criteria in binary visibility graph perspective
• Exploration of period-doubling cascade route to chaos with complex network based time series construction
• Econophysics: Bridges over a Turbulent Current