From time series to complex networks: The visibility graph

By Lucas Lacasa, B. Luque, Fernando J. Ballesteros, Jordi Luque, J. C. Nuño. Proceedings of the National Academy of Sciences of the United States of America, 2008

1,655 citations recorded by the source corpus.

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.

Subfields: Condensed Matter Physics, Economics and Econometrics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/a0c1483e0e34fb9bc1baf929ce892f111e329fa6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Condensed Matter Physics

  1. R. Sujith
  2. Matthew P. Juniper
  3. Ruijin Du
  4. H. Eugene Stanley
  5. Minggang Wang
  6. Jürgen Kurths
  7. F. Serinaldi
  8. Wei‐Xing Zhou

In Economics and Econometrics

  1. Norbert Marwan
  2. Jürgen Kurths
  3. Yong Zou
  4. Reik V. Donner
  5. Jonathan F. Donges
  6. Wei‐Xing Zhou
  7. Minggang Wang
  8. Ruijin Du

In Statistical and Nonlinear Physics

  1. Norbert Marwan
  2. Yong Zou
  3. Reik V. Donner
  4. Jonathan F. Donges
  5. Jürgen Kurths
  6. Wei‐Xing Zhou
  7. R. Sujith
  8. Matthew P. Juniper

Citations in the corpus