Fast transformation from time series to visibility graphs

Hongming Mo · Shiyu Chen · Qi Liu · Yong Deng

81 citations0/0 files storedChaos An Interdisciplinary Journal of Nonlinear Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Complex Systems and Time Series Analysis Complex Network Analysis Techniques Time Series Analysis and Forecasting

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

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 81 citations exist upstream.

References

2008From time series to complex networks: The visibility graph 1999Introduction to Econophysics 2009Horizontal visibility graphs: Exact results for random time series 2009Complex network approach for recurrence analysis of time series 2009The visibility graph: A new method for estimating the Hurst exponent of fractional Brownian motion 2007Complex network-based time series analysis 2015Generalized evidence theory 2012Time series irreversibility: a visibility graph approach

Cited by

2017Visibility graph analysis of wall turbulence time-series

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.