Fast Horizontal Visibility Graph (HVG) for MATLAB

Unweighted FAST implementation of the horizontal visibility algorithm for mapping time-series in complex networks


Updated 7 Mar 2022

View License

MATLAB implementation of the fast (Divide&Conquer) algorithm for the construction of the HVG. The series and a time vector are required as inputs. The symmetrical adjacency matrix is returned as output. Please let me know if there is any issue or compatibility problem.
If you use this code, please cite
Iacobello, G., et al (2018). Physics Letters A, 382(1), 1-11.
Other References:
Luque, B., et al. (2009). Physical Review E, 80(4), 046103.
Lacasa, L., et al. (2008). PNAS, 105(13), 4972-4975.
Lan, X., et al. (2015). Chaos, 25(8), 083105.

Cite As

Giovanni Iacobello (2023). Fast Horizontal Visibility Graph (HVG) for MATLAB (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2017b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Find more on Directed Graphs in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!


Version Published Release Notes

Major improvement: resolved infinite recursion for very large non-convex intervals


Minor changes to variables description


Improved link storage. Faster version.


Minor changes