Topological structure and entropy of mixing graph maps
From MaRDI portal
Publication:2928252
Abstract: Let be the family of all topologically mixing, but not exact self-maps of a topological graph . It is proved that the infimum of topological entropies of maps from is bounded from below by , where is a constant depending on the combinatorial structure of . The exact value of the infimum on is calculated for some families of graphs. The main tool is a refined version of the structure theorem for mixing graph maps. It also yields new proofs of some known results, including Blokh's theorem (topological mixing implies specification property for maps on graphs).
Recommendations
- A note on the periodic orbits and topological entropy of graph maps
- Horseshoes, entropy and periods for graph maps
- Topological entropy and periods of graph maps
- Topological entropy of continuous self-maps on a graph
- A description to the topological entropy of a continuous map of a class of finite graph
Cites work
- A note on transitivity, sensitivity and chaos for graph maps
- A splitting theorem for transitive maps
- An Introduction to Symbolic Dynamics and Coding
- Concerning continuum-wise fully expansive homeomorphisms of continua
- Continuum Theory and Graph Theory: Disconnection Numbers
- Dimensional entropy over sets and fibres
- Entropy and exact Devaney chaos on totally regular continua
- Entropy and periodic points for transitive maps
- Entropy estimates for transitive maps on trees
- Entropy of transitive tree maps
- Exact Devaney chaos and entropy
- Extensions of dynamical systems without increasing the entropy
- Regular periodic decompositions for topologically transitive maps
- Specification on the interval
- Strong Transitivity and Graph Maps
- Topological chaos: what may this mean?
- Topological entropy and chaos for maps induced on hyperspaces
- Topological entropy of Devaney chaotic maps
- Topological entropy of transitive maps of a tree
- Transitivity and Dense Periodicity for Graph Maps
- Transitivity and the centre for maps of the circle
- Weak mixing implies mixing for maps on topological graphs
- When lower entropy implies stronger Devaney chaos
Cited in
(10)- scientific article; zbMATH DE number 1880736 (Why is no real title available?)
- On recurrence and entropy in the hyperspace of continua in dimension one
- Topological entropy of compact subsystems of transitive real line maps
- Total variation of a curve under chaos on the real line and on a finite graph
- Topologically mixing maps and the pseudoarc
- Periodic points and transitivity on dendrites
- Operators with the specification property
- Properties of invariant measures in dynamical systems with the shadowing property
- Weak mixing implies mixing for maps on topological graphs
- On the structure of \(\alpha \)-limit sets of backward trajectories for graph maps
This page was built for publication: Topological structure and entropy of mixing graph maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928252)