Next Higher Point: two Novel Approaches for Computing Natural Visibility Graphs Patrick Daniel, Vanessa Silva and Pedro Ribeiro 2024

Abstract

With the huge amount of data that has been collected over time, many methods are being developed to allow better understanding and forecasting in several domains. Time series analysis is a powerful tool to achieve this goal. Despite being a well-established area, there are some gaps, and new methods are emerging to overcome these limitations, such as visibility graphs. Visibility graphs allow the analyses of times series as complex networks and make possible the use of more advanced techniques from another well-established area, network science. In this paper, we present two new efficient approaches for computing natural visibility graphs from times series, one for online scenarios in O(n log n) and the other for offline scenarios in O(nm), the latter taking advantage of the number of different values in the time series (m).

Keywords

times series; visibility graphs; online data; offline data

Publication in PDF format

pdf Download PDF

Journal/Conference/Book

13th International Conference on Complex Networks and their Applications

Reference (text)

Patrick Daniel, Vanessa Silva and Pedro Ribeiro. Next Higher Point: two Novel Approaches for Computing Natural Visibility Graphs. Proceedings of the 13th International Conference on Complex Networks and their Applications (CNA), Springer, Istambul, Turkey, December, 2024.

Bibtex

@inproceedings{ribeiro-CNA2024,
  author = {Patrick Daniel and  Vanessa Silva and Pedro Ribeiro},
  title = {Next Higher Point: two Novel Approaches for Computing Natural Visibility Graphs},
  booktitle = {13th International Conference on Complex Networks and their Applications},
  publisher = {Springer},
  month = {December},
  year = {2024}
}