Feigenbaum graphs at the onset of chaos
Data(s) |
2012
|
---|---|
Resumo |
We analyze the properties of networks obtained from the trajectories of unimodal maps at the transi- tion to chaos via the horizontal visibility (HV) algorithm. We find that the network degrees fluctuate at all scales with amplitude that increases as the size of the network grows, and can be described by a spectrum of graph-theoretical generalized Lyapunov exponents. We further define an entropy growth rate that describes the amount of information created along paths in network space, and find that such en- tropy growth rate coincides with the spectrum of generalized graph-theoretical exponents, constituting a set of Pesin-like identities for the network. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
E.T.S.I. Aeronáuticos (UPM) |
Relação |
http://oa.upm.es/16711/1/INVE_MEM_2012_136107.pdf FIS2009-13690 / S2009ESP-1691 info:eu-repo/semantics/altIdentifier/doi/10.1016/j.physleta.2012.10.050 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
Physics Letters a, ISSN 0375-9601, 2012, Vol. 376 |
Palavras-Chave | #Aeronáutica #Matemáticas |
Tipo |
info:eu-repo/semantics/article Artículo PeerReviewed |