From the time series to the complex networks: the parametric natural visibility graph

From MaRDI portal
Publication:1783098

DOI10.1016/J.PHYSA.2014.07.002zbMATH Open1395.62264arXiv1208.6365OpenAlexW2197473678MaRDI QIDQ1783098FDOQ1783098


Authors: I. V. Bezsudnov, Andrei Snarskii Edit this on Wikidata


Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1208.6365




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: From the time series to the complex networks: the parametric natural visibility graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783098)