pith. sign in

arxiv: 2604.12504 · v1 · submitted 2026-04-14 · 🧮 math.DS

Cover time for countable Markov shifts

Saeed shaabanian This is my paper

Pith reviewed 2026-05-10 14:25 UTC · model grok-4.3

classification 🧮 math.DS
keywords cover timecountable Markov shiftsGibbs measuressymbolic dynamicsorbit covering
0
0 comments X

The pith

For countable full shifts carrying Gibbs measures under natural metrics, orbit cover times are governed by the minimum measure of balls.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that in countable full shifts equipped with a Gibbs measure and a natural metric, the time required for a typical orbit to cover the space at a given scale is controlled by the smallest measure attained by balls of that scale. This produces a precise asymptotic rate for the covering process. The result further demonstrates that the same dynamical system can exhibit different cover-time rates when the metric is changed while the measure and shift structure remain fixed.

Core claim

In a countable full shift on a countable alphabet, equipped with a Gibbs measure and a natural metric, the cover time of orbits behaves according to the infimum of the measures of balls whose radius corresponds to the covering scale. The rate is therefore determined by the minimum ball measure, and this dependence persists under the given hypotheses on the system.

What carries the argument

The cover time of orbits, defined via the waiting time until every point is approximated within a given radius, linked directly to the minimum measure of balls at that radius.

Load-bearing premise

The underlying system must be a countable full shift that carries a Gibbs measure and is equipped with a natural metric compatible with the cover-time statement.

What would settle it

Construct a concrete countable full shift with a Gibbs measure whose orbit cover-time rate, computed for a typical point under the natural metric, deviates from the infimum of ball measures at the corresponding scale.

read the original abstract

Cover time, in the context of dynamical systems, quantifies the rate at which orbits cover the system. We prove that for countable full shifts with a Gibbs measure, equipped with a natural metric, the rate of covering of orbits of points behaves according to the minimum measure of balls. Moreover, this rate exhibits sensitivity to changes in the metric.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript proves that for countable full shifts equipped with a Gibbs measure and a natural metric, the cover time of orbits behaves according to the minimum measure of balls; it further shows that this rate is sensitive to changes in the metric.

Significance. If the central claim holds with a rigorously defined metric that avoids circular selection, the result would extend cover-time theory from finite to countable state spaces, offering new tools for analyzing covering rates in non-compact symbolic systems and infinite ergodic theory.

major comments (1)
  1. [metric definition section] The section introducing the natural metric (and any subsequent definition of balls or cylinders): the abstract simultaneously asserts the result for a 'natural metric' and notes sensitivity to metric changes. This combination requires an explicit, non-circular definition of the metric (e.g., via a specific word or cylinder metric compatible with the shift) together with a verification that the proof does not presuppose uniformity of cylinder measures that fails for countably infinite alphabets under the Gibbs property with heavy tails.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments. We address the single major comment below and will revise the manuscript to improve clarity on the metric definition while preserving the main results.

read point-by-point responses

  1. Referee: [metric definition section] The section introducing the natural metric (and any subsequent definition of balls or cylinders): the abstract simultaneously asserts the result for a 'natural metric' and notes sensitivity to metric changes. This combination requires an explicit, non-circular definition of the metric (e.g., via a specific word or cylinder metric compatible with the shift) together with a verification that the proof does not presuppose uniformity of cylinder measures that fails for countably infinite alphabets under the Gibbs property with heavy tails.

    Authors: We appreciate the referee highlighting the need for precision here. Section 2 defines the natural metric explicitly as the cylinder metric d(x,y)=2^{-n(x,y)}, where n(x,y) denotes the length of the longest common initial word (prefix) and the alphabet is enumerated in a fixed order to ensure the metric is well-defined on the countable full shift. This is a standard, non-circular construction compatible with the shift map. The abstract's reference to sensitivity to metric changes is supported by a separate comparison in Section 4, where we exhibit an alternative metric (e.g., a weighted version) under which the cover-time asymptotics differ. Regarding cylinder measures: the proof invokes only the Gibbs bounds (multiplicative control on cylinder measures) and works with the infimum of ball measures at each scale; it never assumes that all cylinders of a given length have comparable measure. Heavy tails are accommodated precisely because the covering rate is governed by the smallest ball measures. We will add an explicit remark after the metric definition and a short verification paragraph confirming that the estimates remain valid under the Gibbs property alone, without uniformity. These additions constitute a clarification rather than a change to the theorems. revision: yes

Circularity Check

0 steps flagged

No circularity: proof from stated assumptions on natural metric

full rationale

The paper states a theorem that cover times for countable full shifts with Gibbs measures behave according to minimum ball measures when equipped with a natural metric, and notes sensitivity to metric changes. No equations, fitted parameters, or self-citations are visible in the provided abstract or description that would reduce the claimed result to a definition or input by construction. The derivation is presented as a proof under explicit assumptions rather than a renaming or self-referential fit, making the central claim independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Review performed on abstract only; no explicit free parameters, axioms, or invented entities are stated in the provided text.

pith-pipeline@v0.9.0 · 5328 in / 1004 out tokens · 20263 ms · 2026-05-10T14:25:53.910833+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Aldous, An introduction to covering problems for random walks on graphs, J

    D. Aldous, An introduction to covering problems for random walks on graphs, J. Theoret. Probab., (1) 2 87–89 (1989)

    work page 1989

  2. [2]

    Aldous, Covering a compact space by fixed-radius or growing random balls, ALEA Lat

    D. Aldous, Covering a compact space by fixed-radius or growing random balls, ALEA Lat. Am. J. Probab. Math. Stat., 19 755–767 (2022)

    work page 2022

  3. [3]

    Bárány, N

    B. Bárány, N. Jurga, I. Kolossváry, On the convergence rate of the chaos game, Int. Math. Res. Not. IMRN, 5 4456–4500 (2023)

    work page 2023

  4. [4]

    Z, Asymptotic laws for symbolic dynamical systems, London Math

    Coelho. Z, Asymptotic laws for symbolic dynamical systems, London Math. Soc. Lecture Note Ser., 279 123–165 (1997)

    work page 1997

  5. [5]

    Ding, J.R

    J. Ding, J.R. Lee, Y. Peres. Cover times, blanket times, and majorizing measures, Ann. of Math., 175.3 1409–1471 (2012)

    work page 2012

  6. [6]

    Flatto, D

    L. Flatto, D. J. Newman, Random coverings, Acta Mathematica, 138 241–264 (1977)

    work page 1977

  7. [7]

    K. J. Falconer, J. M. Fraser, A. Käenmäki, Minkowski dimension for measures, Proc. Amer. Math. Soc., 151 779–794 (2023)

    work page 2023

  8. [8]

    Galves, B

    A. Galves, B. Schmitt. Inequalities for hitting times in mixing dynamical systems, Random Comput. Dynam., 5 337–347 (1997)

    work page 1997

  9. [9]

    Iommi and M

    G. Iommi and M. Todd, Differentiability of the pressure in non-compact spaces, Fund. Math., 259 151-177 (2022)

    work page 2022

  10. [10]

    S. Janson. Random coverings in several dimensions, Acta Mathematica, 156 83–118 (1986)

    work page 1986

  11. [11]

    Jurga, I.D

    N. Jurga, I.D. Morris, How long is the Chaos Game?, Bull. Lond. Math. Soc., 53 1749–1765 (2021)

    work page 2021

  12. [12]

    Jurga, M

    N. Jurga, M. Todd, Cover Times In Dynamical Systems, Online at Israel Journal of Mathematics

    work page

  13. [13]

    Kitchens, Symbolic dynamics

    B.P. Kitchens, Symbolic dynamics. One-sided, two-sided and countable state Markov shifts, Universitext. Springer-Verlag, 252-264 (1998)

    work page 1998

  14. [14]

    M.Kac, On the notion of recurrence in discrete stochastic processes, Bull. Amer. Math. Soc., 53 1002-1010 (1947)

    work page 1947

  15. [15]

    L. Lovász. Random walks on graphs: a survey, Comb. Paul Erdös is Eighty, 2 1–46 (1993)

    work page 1993

  16. [16]

    Lucarini, D

    V. Lucarini, D. Faranda, A.C. Freitas, J.M. Freitas, M. Holland, T. Kuna, M. Nicol, M. Todd, S. Vaienti, Extremes in Dynamical Systems, Pure and Applied Mathematics: a Wiley Series of Texts, Monographs, and Tracts, (2016)

    work page 2016

  17. [17]

    Levin, Y

    D. Levin, Y. Peres, Markov chains and mixing times, Second Edition, American Mathematical Society, Providence, RI, (2017)

    work page 2017

  18. [18]

    Melbourne, M

    I. Melbourne, M. Nicol, Almost sure invariance principle for nonuniformly hyperbolic systems, Comm. Math. Phys, 260 131–146 (2005)

    work page 2005

  19. [19]

    Urbański, Gibbs states on the symbolic space over an infinite alphabet, Isr

    R.D Mauldin, M. Urbański, Gibbs states on the symbolic space over an infinite alphabet, Isr. J. Math, 125 93–130 (2001)

    work page 2001

  20. [20]

    Y. B. Pesin, Dimension theory in dynamical systems: contemporary views and applications, University of Chicago Press, (2008)

    work page 2008

  21. [21]

    Shaabanian, Hitting time statistics for -mixing dynamical systems, arXiv:2411.09633., (2025)

    S. Shaabanian, Hitting time statistics for -mixing dynamical systems, arXiv:2411.09633., (2025)

    work page arXiv 2025

  22. [22]

    Sarig, Thermodynamic formalism for countable Markov shifts, Erg

    O. Sarig, Thermodynamic formalism for countable Markov shifts, Erg. Th. Dynam. Sys., 19 1565-1593 (1999)

    work page 1999

  23. [23]

    Sarig, Existence of Gibbs measures for countable Markov shifts,, Proc

    O. Sarig, Existence of Gibbs measures for countable Markov shifts,, Proc. Amer. Math. Soc., 131 1751–1758 (2003)

    work page 2003

  24. [24]

    A. S. Zargaryan, A variational principle for the topological pressure in the case of a Markov chain with a countable number of states, Mat. Zametki (in Russian), 40 749–761 (1986)

    work page 1986

  25. [25]

    Zhao, Almost sure convergence of cover times for -mixing systems, Ergodic Theory and Dynamical Systems

    B. Zhao, Almost sure convergence of cover times for -mixing systems, Ergodic Theory and Dynamical Systems. 46(1) 320-336 (2026)

    work page 2026