Efficient On-line Computation of Visibility Graphs

Abstract

A visibility algorithm maps time series into complex networks following a simple criterion. The resulting visibility graph has recently proven to be a powerful tool for time series analysis. However its straightforward computation is time-consuming and rigid, motivating the development of more efficient algorithms. Here we present a highly efficient method to compute visibility graphs with the further benefit of flexibility: on-line computation. We propose an encoder/decoder approach, with an on-line adjustable binary search tree codec for time series as well as its corresponding decoder for visibility graphs. The empirical evidence suggests the proposed method for computation of visibility graphs offers an on-line computation solution at no additional computation time cost. The source code is available online.

arXiv commentcode https://github.com/delialia/bst

References in corpus (13)

• Hierarchical Structure in Financial Markets
• From time series to complex networks: the visibility graph
• Recurrence networks - A novel paradigm for nonlinear time series analysis
• Recurrence-based time series analysis by means of complex network methods
• Kernel method for nonlinear Granger causality
• Description of stochastic and chaotic series using visibility graphs
• Network structure of multivariate time series
• Mutual Information Rate-Based Networks in Financial Markets
• Testing time series irreversibility using complex network methods
• Visibility graphs for image processing
• Visibility graphs of random scalar fields and spatial data
• Geometric signature of complex synchronisation scenarios
• On a dynamical approach to some prime number sequences

Cited by in corpus (3)

• Time Series Analysis via Network Science: Concepts and Algorithms
• Counting Horizontal Visibility Graphs
• A novel weighted approach for time series forecasting based on visibility graph