Fast natural visibility graph (NVG) for MATLAB

Version 5.0.0 (26.4 KB) by Giovanni Iacobello
Weighted and Unweighted FAST implementation of the visibility algorithm for mapping signals in complex networks.
5.0
(1)
768 Downloads
Updated 7 Mar 2022

View License

MATLAB implementation of the fast (Divide&Conquer) algorithm for the construction of the NVG. 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. (2021). Journal of Fluid Mechanics, 918, A13.
Iacobello, G., et al (2019). Physical Review Fluids, 4(10), 104501.
Other References:
Lacasa, L., et al. (2008). PNAS, 105(13), 4972-4975.
Lan, X., et al. (2015). Chaos, 25(8), 083105.

Cite As

Giovanni Iacobello (2024). Fast natural visibility graph (NVG) for MATLAB (https://www.mathworks.com/matlabcentral/fileexchange/70432-fast-natural-visibility-graph-nvg-for-matlab), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2017b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
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!

fast_NVG/fast_NVG

Version Published Release Notes
5.0.0

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

Minor changes update
4.1.0

Minor changes to variables description
4.0.0

NEW FEATURE: possibility to account for signal periodicity (closed series).

3.0.0

Change: neighbour saving approach.
Increased performance. The computational time is significantly reduced.
2.0.2

minor updates
2.0.1

comments update
2.0.0

Weighted - Unweighted option
1.0.4

Comments update
1.0.3

Comments update
1.0.2

Update: Linux compatibility
1.0.1

Minor changes: comments update
1.0.0