Randomness criteria in binary visibility graph perspective

Details Randomness criteria in binary visibility graph perspective Randomness criteria in binary visibility graph perspective

2010-04-09

arxiv.org/abs/1004.2189v1

Nonlinear Sciences

Chaotic Dynamics

13 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Randomness criteria in binary visibility graph perspective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomness criteria in binary visibility graph perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomness criteria in binary visibility graph perspective will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221865