Pith. sign in

REVIEW 2 cited by

Empirical and Instance-Dependent Estimation of Markov Chain and Mixing Time

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.06845 v4 pith:432MST22 submitted 2019-12-14 math.PR cs.LGstat.ML

Empirical and Instance-Dependent Estimation of Markov Chain and Mixing Time

classification math.PR cs.LGstat.ML
keywords mixingcontractionspectraltimechaincoefficientestimateestimating
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We address the problem of estimating the mixing time of a Markov chain from a single trajectory of observations. Unlike most previous works which employed Hilbert space methods to estimate spectral gaps, we opt for an approach based on contraction with respect to total variation. Specifically, we estimate the contraction coefficient introduced in Wolfer [2020], inspired from Dobrushin's. This quantity, unlike the spectral gap, controls the mixing time up to strong universal constants and remains applicable to non-reversible chains. We improve existing fully data-dependent confidence intervals around this contraction coefficient, which are both easier to compute and thinner than spectral counterparts. Furthermore, we introduce a novel analysis beyond the worst-case scenario by leveraging additional information about the transition matrix. This allows us to derive instance-dependent rates for estimating the matrix with respect to the induced uniform norm, and some of its mixing properties.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Black-Box Detection of LLM-Generated Text Using Generalized Jensen-Shannon Divergence

    cs.LG 2025-10 conditional novelty 6.0

    A reference-based detector that scores text by the generalized Jensen–Shannon gap between its surprisal-state transition matrix and fixed human/machine references.

  2. Black-Box Detection of LLM-Generated Text Using Generalized Jensen-Shannon Divergence

    cs.LG 2025-10 unverdicted novelty 5.0

    SurpMark detects machine-generated text by estimating state-transition matrices from discretized surprisals and scoring them with generalized Jensen-Shannon divergence to human versus machine references.