Randomness criteria in binary visibility graph and complex network perspective

详细信息	查看全文 | 推荐本文 |

• 作者：Sodeif Ahadpour ; ^{ahadpour@uma.ac.ir} ; Yaser Sadra
• 关键词：Binary visibility graph ; Random binary sequence ; Complex network ; Randomness criteria
• 刊名：Information Sciences
• 出版年：2012
• 期刊代码：62_00200255
• 类别：cp
• 出版时间：15 August, 2012
• 卷：197
• 期：Complete
• 页码：161-176
• 文件大小：820 K

摘要

We introduce the binary visibility graph (BVG) for mapping random binary sequences into complex networks. Several topological aspects of the constructed graphs, such as degree distribution, clustering coefficient, and mean visibility length have been thoroughly investigated. Our simulations on the probability distributions for four sample random binary sequences (RBS) confirm the reliability of the BVG for RBS analysis. Moreover, we propose the topological properties of the graph as a randomness criteria. In this way, we have presented some possible randomness tests using BVG. A comparison has been made between these tests and National Institute of Standards and Technology (NIST) tests on four samples and the results are promising. These tests can distinguish between weak and strong RBSs.