Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo’s paradox

Jose S. Cánovas and María Muñoz Guillermo

Chaos, Solitons & Fractals, 2016, vol. 83, issue C, 1-17

Abstract: We introduce an algorithm to compute the topological entropy of piecewise monotone maps with at most three different kneading sequences, with prescribed accuracy. As an application, we compute the topological entropy of 3-periodic sequences of logistic maps, disproving a commutativity formula for topological entropy with three maps, and analyzing the dynamics Parrondo’s paradox in this setting.

Keywords: Topological entropy; Kneading sequences; Chaos; Parrondo’s paradox (search for similar items in EconPapers)
Date: 2016
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/S096007791500363X
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:83:y:2016:i:c:p:1-17

DOI: 10.1016/j.chaos.2015.10.036

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