Characterizing stochastic time series with ordinal networks

Abstract

Approaches for mapping time series to networks have become essential tools for dealing with the increasing challenges of characterizing data from complex systems. Among the different algorithms, the recently proposed ordinal networks stand out due to its simplicity and computational efficiency. However, applications of ordinal networks have been mainly focused on time series arising from nonlinear dynamical systems, while basic properties of ordinal networks related to simple stochastic processes remain poorly understood. Here, we investigate several properties of ordinal networks emerging from random time series, noisy periodic signals, fractional Brownian motion, and earthquake magnitude series. For ordinal networks of random series, we present an approach for building the exact form of the adjacency matrix, which in turn is useful for detecting non-random behavior in time series and the existence of missing transitions among ordinal patterns. We find that the average value of a local entropy, estimated from transition probabilities among neighboring nodes of ordinal networks, is more robust against noise addition than the standard permutation entropy. We show that ordinal networks can be used for estimating the Hurst exponent of time series with accuracy comparable with state-of-the-art methods. Finally, we argue that ordinal networks can detect sudden changes in Earth seismic activity caused by large earthquakes.

14 two-column pages, 8 figures; accepted for publication in Physical Review E

References in corpus (10)

• From time series to complex networks: the visibility graph
• Complex network approaches to nonlinear time series analysis
• Insightful classification of crystal structures using deep learning
• Description of stochastic and chaotic series using visibility graphs
• Comparing the performance of FA, DFA and DMA using different synthetic long-range correlated time series
• History of art paintings through the lens of entropy and complexity
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• Conditional entropy of ordinal patterns
• Topological Information Data Analysis
• Quantifying sudden changes in dynamical systems using symbolic networks

Cited by in corpus (13)

• ordpy: A Python package for data analysis with permutation entropy and ordinal network methods
• 20 years of ordinal patterns: Perspectives and challenges
• Time Series Analysis via Network Science: Concepts and Algorithms
• Determining liquid crystal properties with ordinal networks and machine learning
• Mapping images into ordinal networks
• A generalized permutation entropy for random processes
• Characterizing unstructured data with the nearest neighbor permutation entropy
• Unveiling the connectivity of complex networks using ordinal transition methods
• Effective de Sitter space, quantum behaviour and large-scale spectral dimension (3+1)
• Complexity-based permutation entropies: from deterministic time series to white noise
• Similarity networks of ordinal-pattern transitions classify falling paper trajectories
• Quantifying the irregularity of a time series
• Ordinal Synchronization and Typical States in High-Frequency Digital Markets