Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index

Abstract

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.

12 pages, 8 figures

References in corpus (16)

• From time series to complex networks: the visibility graph
• Complex Network Approach for Recurrence Analysis of Time Series
• Recurrence-based time series analysis by means of complex network methods
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Description of stochastic and chaotic series using visibility graphs
• Fractality in complex networks: critical and supercritical skeletons
• Ambiguities in recurrence-based complex network representations of time series
• Degree distribution of the visibility graphs mapped from fractional Brownian motions and multifractal random walks
• A characterization of horizontal visibility graphs and combinatorics on words
• A box-covering algorithm for fractal scaling in scale-free networks
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Geographical Coarsegraining of Complex Networks
• Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
• Networks of motifs from sequences of symbols
• Fractal Analysis on Human Behaviors Dynamics
• Randomness criteria in binary visibility graph perspective

Cited by in corpus (19)

• Complex network approaches to nonlinear time series analysis
• A characterization of horizontal visibility graphs and combinatorics on words
• Distinguishing noise from chaos: objective versus subjective criteria using Horizontal Visibility Graph
• Sequential motif profile of natural visibility graphs
• Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions
• Visibility graph analysis of economy policy uncertainty indices
• Fractal and complex network analyses of protein molecular dynamics
• Multiplex visibility graphs to investigate recurrent neural networks dynamics
• Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions
• Tetradic motif profiles of horizontal visibility graphs
• Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
• Coupling between time series: a network view
• Persistent Homology of Fractional Gaussian Noise
• Triadic time series motifs
• Time series classification based on triadic time series motifs
• Visibility graphs of critical and off-critical time series for absorbing state phase transitions
• Visibility graph analysis of the grains and oilseeds indices
• Homology Groups of Embedded Fractional Brownian Motion
• Markov-Binary Visibility Graph: a new method for analyzing Complex Systems