Fast transformation from time series to visibility graphs

作者：Lan, Xin; Mo, Hongming; Chen, Shiyu; Liu, Qi; Deng, Yong^*

来源：Chaos, 2015, 25(8): 083105.

DOI：10.1063/1.4927835

• NETWORKS

The visibility graph method is used to transform time series into complex networks. In this letter, a fast transform algorithm is proposed for obtaining a visibility graph. Based on the strategy of "divide & conquer," the time complexity of the proposed algorithm is raised to O(n log n), which is more efficient than the previous basic algorithm whose time complexity is O(n(2)).

• 出版日期2015-8
• 单位四川民族学院; 西南大学