The visibility graph of n-bonacci sequence

Shiwei Bai and Min Niu

Chaos, Solitons & Fractals, 2022, vol. 163, issue C

Abstract: In this paper, we study both the visibility graph and horizontal visibility graph of n-bonacci sequence. Firstly, we map Fibonacci sequence to complex network by using visibility graph algorithm, and its degree sequence is related to some combinatorial properties of words. Then, we study the visibility graph degree distribution of n-bonacci sequence by coding words. We obtain that its degree distribution is between the exponential and power-law distributions. On the other hand, the horizontal visibility graph sequences of n-bonacci sequence over different alphabets correspond to the same n-bonacci sequence, and its degree distribution tends to exponential distribution as n→∞. Finally, we explain the reason why fractal sequences are mapped into scale-free networks.

Keywords: Visibility graph; Time series; Words; The n-bonacci sequence; Combinatorial properties (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077922007056
Full text for ScienceDirect subscribers only

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:chsofr:v:163:y:2022:i:c:s0960077922007056

DOI: 10.1016/j.chaos.2022.112500

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().