Randomness criteria in binary visibility graph perspective
arXiv:1004.2189
Abstract
By means of a binary visibility graph, we present a novel method to study random binary sequences. The behavior of the some topological properties of the binary visibility graph, such as the degree distribution, the clustering coefficient, and the mean path length have been investigated. Several examples are then provided to show that the numerical simulations confirm the accuracy of the theorems for finite random binary sequences. Finally, in this paper we propose, for the first time, three topological properties of the binary visibility graph as a randomness criteria.
arXiv comment13 pages
References in corpus (8)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- From time series to complex networks: the visibility graph
- Complex Network Approach for Recurrence Analysis of Time Series
- Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence
- Degree distribution of the visibility graphs mapped from fractional Brownian motions and multifractal random walks