From the time series to the complex networks: the parametric (dynamical) natural visibility graph
arXiv:1208.6365 · doi:10.1016/j.physa.2014.07.002
Abstract
We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG links, which satisfy an additional constraint determined by a newly introduced continuous parameter - the view angle. The alteration ofview angle modifiesthe PNVG and its properties such as the average node degree, average link length of the graph as well as cluster quantity of built graph etc. Wecalculated and analyzed different PNVG properties depending on the view angle for different types of the time series such as the random (uncorrelated, correlated and fractal) and cardiac rhythm time series for healthy and ill patients. Investigation of different PNVG properties shows that the view angle gives a new approach to characterize the structure of the time series that are invisible in the conventional version of the algorithm. It is also shown that the PNVG approach allows to distinguish, identify and describe in detail various time series.
13 pages, 6 figures
References in corpus (8)
- Critical phenomena in complex networks
- From time series to complex networks: the visibility graph
- Time series irreversibility: a visibility graph approach
- Ambiguities in recurrence-based complex network representations of time series
- Feigenbaum graphs: a complex network perspective of chaos
- Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
- Detecting series periodicity with horizontal visibility graphs
- Critical phenomena in the dynamical visibility graph
Cited by in corpus (15)
- Complex network approaches to nonlinear time series analysis
- Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
- Visibility graph analysis of wall turbulence time-series
- Time Series Analysis via Network Science: Concepts and Algorithms
- Visibility graph analysis of economy policy uncertainty indices
- Mapping images into ordinal networks
- Inferring dissipation from the violation of Fluctuation-Dissipation Theorem
- Theoretical results on the topological properties of the limited penetrable horizontal visibility graph family
- Tetradic motif profiles of horizontal visibility graphs
- Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
- Chinese cities' air quality pattern and correlation
- Exact results of the limited penetrable horizontal visibility graph associated to random time series and its application
- Critical phenomena in the dynamical visibility graph
- Visibility graph analysis of the grains and oilseeds indices
- A Complex Network Analysis on The Eigenvalue Spectra of Random Spin Systems