A simple scalable linear time algorithm for horizontal visibility graphs

DOI10.1016/j.physa.2023.128601OpenAlexW4321503225MaRDI QIDQ2700702

Daniel Köhne, Jonas Schmidt

Publication date: 27 April 2023

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

Full work available at URL: https://doi.org/10.1016/j.physa.2023.128601

zbMATH Keywords

time seriesgraph algorithmstime complexitycomplex networksruntimehorizontal visibility graphs

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Uses Software

• UMAP

Cites Work

• Complex network approach for recurrence analysis of time series
• An efficient forecasting method for time series based on visibility graph and multi-subgraph similarity
• A novel method for forecasting time series based on directed visibility graph and improved random walk
• From time series to complex networks: The visibility graph
• Fully developed turbulence in the view of horizontal visibility graphs
• Fast transformation from time series to visibility graphs

This page was built for publication: A simple scalable linear time algorithm for horizontal visibility graphs