title: 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 with general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing 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.
authors.affiliation: School of Mathematical Sciences, Queen Mary University of London, Mile End Road, E14NS London, United Kingdom.
authors.forename: Jacopo
authors.initials: J
authors.lastname: Iacovacci
authors.affiliation: School of Mathematical Sciences, Queen Mary University of London, Mile End Road, E14NS London, United Kingdom.
authors.forename: Lucas
authors.initials: L
authors.lastname: Lacasa