Planar Visibility Graph Network Algorithm For Two Dimensional Timeseries
arXiv:1411.6438
Abstract
In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar graph. The constructed planar graph inherits several properties of the series in its structure. Thereby, periodic series, random series, and chaotic series convert into quite different networks with different average degree, characteristic path length, diameter, clustering coefficient, different degree distribution, and modularity, etc. By means of this new approach, with such different networks measures, one can characterize two dimensional timeseries from a new viewpoint of complex networks.
arXiv comment8 pages, 8 figures, 1 table, CCCN 2014, Changsha, PR, China, 2014
References in corpus (10)
- From time series to complex networks: the visibility graph
- Recurrence networks - A novel paradigm for nonlinear time series analysis
- Recurrence-based time series analysis by means of complex network methods
- Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence
- Analytical framework for recurrence-network analysis of time series
- Degree distribution of the visibility graphs mapped from fractional Brownian motions and multifractal random walks
- Universal and nonuniversal allometric scaling behaviors in the visibility graphs of world stock market indices
- Complex stock trading network among investors
- Statistical properties of world investment networks
- Mapping from Architecture to Dynamics: A Unified View of Dynamical Processes on Networks