On chaotic graphs: A different approach for characterizing aperiodic dynamics

Marcello Antonio Budroni, Enzo Tiezzi and Mauro Rustici

Physica A: Statistical Mechanics and its Applications, 2010, vol. 389, issue 18, 3883-3891

Abstract: Fractal worlds with limited connectivity are the topological result of growing graphs from chaotic series. We show how this model presents original characteristics which cannot be detected by means of the standard network descriptors. In detail, intrinsic inaccessibility to the fully connected configuration is demonstrated to be a universal feature associated with this family of graphs and strictly related to the fractality of a specific “chaotic source”. Here we discuss the potential of our model to be a generator of fractal graphs and also a self-consistent tool for differentiating chaotic dynamics from stochastic processes.

Keywords: Chaotic graphs; Fractal attractor transformation in complex networks; Nonlinear time series analysis (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437110004796
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:389:y:2010:i:18:p:3883-3891

DOI: 10.1016/j.physa.2010.05.049

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 ().