# Novel method of identifying time series based on network graphs

@article{Li2011NovelMO, title={Novel method of identifying time series based on network graphs}, author={Ying Li and Hongduo Ca{\"o} and Yong Tan}, journal={Complexity}, year={2011}, volume={17}, pages={13-34} }

- Published 2011 in Complexity
DOI:10.1002/cplx.20384

In this article, we propose a novel method for transforming a time series into a complex network graph. The proposed algorithm is based on the spatial distribution of a time series. The characteristics of geometric parameters of a network represent the dynamic characteristics of a time series. Our algorithm transforms, respectively, a constant series into a fully connected graph, periodic time series into a regular graph, linear divergent time series into a tree, and chaotic time series into an… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 27 references

## Complex network from pseudoperiodic time series: topology versus dynamics.

View 5 Excerpts

Highly Influenced

## Statistical mechanics of complex networks

View 6 Excerpts

Highly Influenced

## A comparison of two methods for modeling large-scale data from time series as complex networks

View 1 Excerpt

## Complex networks: Structure and dynamics

View 3 Excerpts

## Networks of motifs from sequences of symbols.

View 1 Excerpt

## Networks: An Introduction

View 1 Excerpt

## From time series to complex networks: the visibility graph.

View 2 Excerpts