Answers are grounded in this paper and cite their sources.
We determine the order of the worst-start chi-square mixing time of the coordinate-permutation Burnside chain on words of length \(n\) over a fixed alphabet. For every fixed \(k≥ 3\), the upper bound is \(O(n/log n)\), matching the known lower order. More generally, for the twisted chain with fixed cycle-weight parameter \(θ>0\), chi-square distance tends to zero uniformly over all labeled starting words at time \( cn/log n\) whenever \(c>log k/(2θ)\). The proof uses the established representation by products of stochastic matrices with independent Dirichlet rows. A bound on the probability that two rows have small overlap gives polynomial decay of all moments of the Dobrushin coefficient. Inserting these estimates into the trace expansion yields a stationary-average bound that decays faster than every inverse polynomial. Coordinate symmetry then gives the uniform starting-state bound.
No takes yet. Share an insight, caveat, or question.
Sam Vaseghi (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: