Nonlinear time series analysis aims at understanding the dynamics of stochastic or chaotic processes. In recent years, quite a few methods have been proposed to transform a single time series to a complex network so that the dynamics of the process can be understood by investigating the topological properties of the network. We study the topological properties of horizontal visibility graphs constructed from fractional Brownian motions with different Hurst index $H\in(0,1)$. Special attention has been paid to the impact of Hurst index on the topological properties. It is found that the clustering coefficient $C$ decreases when $H$ increases. We also found that the mean length $L$ of the shortest paths increases exponentially with $H$ for fixed length $N$ of the original time series. In addition, $L$ increases linearly with respect to $N$ when $H$ is close to 1 and in a logarithmic form when $H$ is close to 0. Although the occurrence of different motifs changes with $H$, the motif rank pattern remains unchanged for different $H$. Adopting the node-covering box-counting method, the horizontal visibility graphs are found to be fractals and the fractal dimension $d_B$ decreases with $H$. Furthermore, the Pearson coefficients of the networks are positive and the degree-degree correlations increase with the degree, which indicate that the horizontal visibility graphs are assortative. With the increase of $H$, the Pearson coefficient decreases first and then increases, in which the turning point is around $H=0.6$. The presence of both fractality and assortativity in the horizontal visibility graphs converted from fractional Brownian motions is different from many cases where fractal networks are usually disassortative.
In this paper we introduce the horizon visibility graph, a simple extension to the popular horizontal visibility graph representation of a time series, and show that it possesses a rigorous mathematical foundation in computational algebraic topology. This fills a longstanding gap in the literature on the horizontal visibility approach to nonlinear time series analysis which, despite a suite of successful applications across multiple domains, lacks a formal setting in which to prove general properties and develop natural extensions. The main finding is that horizon visibility graphs are dual to…
On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches
We explore the order in chaos by studying the geometric structure of time series that can be deduced from a visibility mapping. This visibility mapping associates to each point $(t,x(t))$ of the time series to its horizontal visibility basin, i.e. the number of points of the time series that can be seen horizontally from each respective point. We apply this study to the class of unimodal maps that give rise to equivalent bifurcation diagrams. We use the classical logistic map to illustrate the main results of this paper: there are visibility patterns in each cascade of the bifurcation diagram,…
Correlations in multifractal series have been investigated, extensively. Almost all approaches try to find scaling features of a given time series. However, the analysis of such scaling properties has some difficulties such as finding a proper scaling region. On the other hand, such correlation detection methods may be affected by the probability distribution function of the series. In this article, we apply the horizontal visibility graph algorithm to map stochastic time series into networks. By investigating the magnitude and sign of a multifractal time series, we show that one can detect li…
A Horizontal Visibility Graph (HVG) is a simple graph extracted from an ordered sequence of real values, and this mapping has been used to provide a combinatorial encryption of time series for the task of performing network based time series analysis. While some properties of the spectrum of these graphs --such as the largest eigenvalue of the adjacency matrix-- have been routinely used as measures to characterise time series complexity, a theoretic understanding of such properties is lacking. In this work we explore some algebraic and spectral properties of these graphs associated to periodic…
