Almost sure convergence of cover times for -mixing systems

Abstract

Given a topologically transitive system on the unit interval, one can investigate the cover time, i.e. time for an orbit to reach certain level of resolution in the repeller. We introduce a new notion of dimension, namely the stretched Minkowski dimension, and show that under mixing conditions, the asymptotics of typical cover times are determined by Minkowski dimensions when they are finite, or by stretched Minkowski dimensions otherwise. For application, we show that for countably full-branched affine maps, results using the usual Minkowski dimensions fail to produce a finite log limit of cover times whilst the stretched version gives an finite limit. In addition, cover times of irrational rotations are explicitly calculated as counterexamples, due to the absence of mixing.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…