The π sequence as a complex network

Kenneth W.K. Lui, H.C. So and Guanrong Chen

Physica A: Statistical Mechanics and its Applications, 2008, vol. 387, issue 22, 5653-5661

Abstract: In this paper, a new topological approach for studying a sufficiently long random number sequence is proposed. By segmenting the sequence into groups of digits which represent the node identities while the undirected edges symbolize the adjacency between them, a network is constructed for analysis. In particular, the network constructed from a π sequence is examined in detail and its properties are contrasted with the Erdos–Renyi (ER) random graph model. Based on the observation that there are more nodes with even degrees than the adjacent odd counterparts in the constructed network, a new random graph model named Random Eulerian (RE) model and its extension are finally proposed and analyzed.

Keywords: Complex network; Random graph theory; Eulerian graph; π; Degree distribution (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437108005281
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:387:y:2008:i:22:p:5653-5661

DOI: 10.1016/j.physa.2008.06.002

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().