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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Complex network from pseudoperiodic time series: topology versus dynamics.

Physical review letters • 2006
View 5 Excerpts
Highly Influenced

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

Y. Li, H. D. Cao, Y. Tan
AIP Adv 2011, • 2011
View 1 Excerpt

Complex networks: Structure and dynamics

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, D. U. Hwang
Phys Rep 2006, • 2011
View 3 Excerpts

Networks: An Introduction

M.E.J. Newman
2010
View 1 Excerpt

Horizontal visibility graphs: exact results for random time series.

Physical review. E, Statistical, nonlinear, and soft matter physics • 2009
View 1 Excerpt

From time series to complex networks: the visibility graph.

Proceedings of the National Academy of Sciences of the United States of America • 2008
View 2 Excerpts

Similar Papers

Loading similar papers…