Sequential visibility-graph motifs

Abstract

Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of sequential visibility graph motifs, smaller substructures of n consecutive nodes that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated to general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable to distinguish among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification and description of physical, biological, and financial time series.

References in corpus (4)

• From time series to complex networks: the visibility graph
• Network structure of multivariate time series
• Time reversibility from visibility graphs of non-stationary processes
• On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches

Cited by in corpus (14)

• Complex network approaches to nonlinear time series analysis
• Visibility graphs for image processing
• Time Series Analysis via Network Science: Concepts and Algorithms
• Sequential motif profile of natural visibility graphs
• Visibility graphs and symbolic dynamics
• Visibility graphs of random scalar fields and spatial data
• Canonical Horizontal Visibility Graphs are uniquely determined by their degree sequence
• Tetradic motif profiles of horizontal visibility graphs
• Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
• Triadic time series motifs
• Prediction is very hard, especially about conversion. Predicting user purchases from clickstream data in fashion e-commerce
• Time series classification based on triadic time series motifs
• Universal visibility patterns of unimodal maps
• Predicting e-commerce customer conversion from minimal temporal patterns on symbolized clickstream trajectories