Fast transformation from time series to visibility graphs

Xin Lan; Hongming Mo; Shiyu Chen; Qi Liu; Yong Deng

doi:10.1063/1.4927835

Fast transformation from time series to visibility graphs

Chaos. 2015 Aug;25(8):083105. doi: 10.1063/1.4927835.

Authors

Xin Lan¹, Hongming Mo¹, Shiyu Chen¹, Qi Liu², Yong Deng¹

Affiliations

¹ School of Computer and Information Science, Southwest University, Chongqing 400715, China.
² Department of Biomedical Informatics, Medical Center, Vanderbilt University, Nashiville, Tennessee 37232, USA.

PMID: 26328556
DOI: 10.1063/1.4927835

Abstract

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)).

Publication types

Research Support, Non-U.S. Gov't

MeSH terms

Algorithms*
Numerical Analysis, Computer-Assisted
Time Factors