From time series to complex networks: The visibility graph
Lucas Lacasa, Bartolo Luque, Fernando Ballesteros, Jordi Luque, Juan Carlos Nuño
Proceedings of the National Academy of Sciences · 2008 · 1,865 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008). From time series to complex networks: The visibility graph. Proceedings of the National Academy of Sciences, 105(13), 4972–4975. https://doi.org/10.1073/pnas.0709247105
In text: (Lacasa et al., 2008)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
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 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.
Related papers
- Investigating Causal Relations by Econometric Models and Cross-spectral Methods1969
- Testing for a Unit Root in Time Series Regression1988
- Power-Law Distributions in Empirical Data2009
- Physiological time-series analysis using approximate entropy and sample entropy2000
- Fractional Brownian Motions, Fractional Noises and Applications1968
Metadata from OpenAlex (CC0). Citations are generated from the published record.