The graph of the logistic map is a tower

DOI10.3934/DCDS.2021075MaRDI QIDQ1983309zbMATH OpenOpenAlexFDO

Authors Roberto De Leo, James A. Yorke

Publication date 10 September 2021

Published in Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.08338

zbMATH Keywords

chain-recurrent setsgraph of a dynamical systemlogistic mapspectral theoremtowers

Mathematics Subject Classification ID

Iteration of real functions in one variable (26A18) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) Gradient-like behavior; isolated (locally maximal) invariant sets; attractors, repellers for topological dynamical systems (37B35) Orbit growth in dynamical systems (37C35) Dynamical systems involving maps of the interval (37E05) Dynamical systems involving maps of trees and graphs (37E25)

Abstract: The qualitative behavior of a dynamical system can be encoded in a graph. Each node of the graph is an equivalence class of chain-recurrent points and there is an edge from node $A$ to node $B$ if, using arbitrary small perturbations, a trajectory starting from any point of A can be steered to any point of B. In this article we describe the graph of the logistic map. Our main result is that the graph is always a tower, namely there is an edge connecting each pair of distinct nodes. Notice that these graphs never contain cycles. If there is an edge from node A to node B, the unstable manifold of some periodic orbit in A contains points that eventually map onto B. For special parameter values, this tower has infinitely many nodes.

Review text

The authors show how to construct a graph for the logistic map where each node of the graph is an equivalence class of chain-recurrent points. With each node it is assigned a numerical value. It is proved that there is an edge of the graph between each pair of nodes, from the higher-value node to the lower-value node. Furthermore, the graph has no cycles and possibly infinitely many nodes. The paper concludes with a chain-recurrent version of the spectral decomposition theorem proved for diffeomorphisms by \textit{S. Smale} [Bull. Am. Math. Soc. 73, 747--817 (1967; Zbl 0202.55202)].

Recommendations

• Generic chaos on graphs
• scientific article; zbMATH DE number 2247494
• Real and complex behavior for networks of coupled logistic maps
• Graphic methods in topological dynamics
• Markov graphs of one-dimensional dynamical systems and their discrete analogues

Cites work

• -limit sets for axiom A diffeomorphisms
• A structure theorem in one dimensional dynamics
• Absolutely continuous invariant measures for one-parameter families of one-dimensional maps
• Accessible saddles on fractal basin boundaries
• Almost every real quadratic map is either regular or stochastic.
• Basin boundary metamorphoses: Changes in accessible boundary orbits
• Bifurcations in one dimension. I. The nonwandering set
• Bifurcations of one- and two-dimensional maps
• Chain recurrence and attraction in non-compact spaces
• Chain transitivity, attractivity, and strong repellors for semidynamical systems
• Crises, sudden changes in chaotic attractors, and transient chaos
• Differentiable dynamical systems
• Dynamics of quadratic polynomials. I, II
• Exotic attractors. From Liapunov stability to riddled basins
• Generic hyperbolicity in the logistic family
• Gradient-like structure and Morse decompositions for time-periodic one- dimensional parabolic equations
• scientific article; zbMATH DE number 3772620 (Why is no real title available?)
• scientific article; zbMATH DE number 3484451 (Why is no real title available?)
• scientific article; zbMATH DE number 3616736 (Why is no real title available?)
• scientific article; zbMATH DE number 467146 (Why is no real title available?)
• scientific article; zbMATH DE number 1014079 (Why is no real title available?)
• scientific article; zbMATH DE number 744034 (Why is no real title available?)
• scientific article; zbMATH DE number 823543 (Why is no real title available?)
• scientific article; zbMATH DE number 846118 (Why is no real title available?)
• Lyapunov functions and isolating blocks
• Measurable dynamics of S-unimodal maps of the interval
• Morse decomposition of semiflows on topological spaces
• Morse decompositions for delay-differential equations
• On gradient dynamical systems
• On the concept of attractor
• Quantitative universality for a class of nonlinear transformations
• Sensitive dependence to initial conditions for one dimensional maps
• Stable Orbits and Bifurcation of Maps of the Interval
• Sur quelques courbes fermées remarquables
• The homotopy index and partial differential equations
• The qualitative analysis of a difference equation of population growth

Cited in

(5)

• Backward asymptotics in S-unimodal maps
• Infinite towers in the graph of a dynamical system
• Streams and graphs of dynamical systems
• Classification of connection graphs of global attractors for S^1-equivariant parabolic equations
• Structural graph and backward asymptotics of tent-like unimodal maps

This page was built for publication: The graph of the logistic map is a tower

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983309)