Mathematics > Dynamical Systems
[Submitted on 20 Dec 2018 (v1), last revised 1 Aug 2019 (this version, v3)]
Title:Long hitting times for expanding systems
View PDFAbstract:We prove a new result in the area of hitting time statistics. Currently, there is a lot of papers showing that the first entry times into cylinders or balls are often faster than the Birkhoff's Ergodic Theorem would suggest. We provide an opposite counterpart to these results by proving that the hitting times into shrinking balls are also often much larger than these theorems would suggest, by showing that for many dynamical systems $$ \displaystyle \limsup_{r\to 0} \tau_{B(y,r)}(x)\mu(B(y,r))=+\infty, $$ for an appropriately large, at least of full measure, set of points $y$ and $x$.
We first do this for all transitive open distance expanding maps and Gibbs/equilibrium states of Hölder continuous potentials; in particular for all irreducible subshifts of finite type with a finite alphabet. Then we prove such result for all finitely irreducible subshifts of finite type with a countable alphabet and Gibbs/equilibrium states for Hölder continuous summable potentials. Next, we show that the \emph{limsup} result holds for all graph directed Markov systems (far going natural generalizations of iterated function systems) and projections of aforementioned Gibbs states on their limit sets. By utilizing the first return map techniques, we then prove the \emph{limsup} result for all tame topological Collect--Eckmann multimodal maps of an interval, all tame topological Collect--Eckmann rational functions of the Riemann sphere, and all dynamically semi--regular transcendental meromorphic functions from $\mathbb{C}$ to $\widehat{\mathbb{C}}$.
Submission history
From: Łukasz Pawelec [view email][v1] Thu, 20 Dec 2018 07:47:45 UTC (26 KB)
[v2] Wed, 30 Jan 2019 19:34:47 UTC (27 KB)
[v3] Thu, 1 Aug 2019 09:47:53 UTC (27 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.