Randomness criteria in binary visibility graph perspective

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

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2010-04
Main Authors: Ahadpour, S, Sadra, Y
Format: Article
Language:English
Subjects:
Clustering
Computer simulation
Randomness
Topology
Visibility
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422