From time series to complex networks: the visibility graph

From MaRDI portal
Publication:3075558

DOI10.1073/PNAS.0709247105zbMATH Open1205.05162arXiv0810.0920OpenAlexW2055538060WikidataQ36516135 ScholiaQ36516135MaRDI QIDQ3075558FDOQ3075558


Authors: Bartolo Luque, Fernando J. Ballesteros, Jordi Luque, Juan Carlos Nuño, Lucas Lacasa Edit this on Wikidata


Publication date: 15 February 2011

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Abstract: In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series convert into regular graphs, and random series do so into random graphs. Moreover, fractal series convert into scale-free networks, enhancing the fact that power law degree distributions are related to fractality, something highly discussed recently. Some remarkable examples and analytical tools are outlined in order to test the method's reliability. Many different measures, recently developed in the complex network theory, could by means of this new approach characterize time series from a new point of view.


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




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





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

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