A variation of strong stationary times for random walks with partial symmetries
Graham White

TL;DR
This paper proposes a new approach to analyze the mixing times of random walks on the symmetric group by focusing on interactions between pairs of cards, offering potentially tighter bounds.
Contribution
It introduces a variation of strong stationary times based on pair interactions, differing from traditional methods that accumulate larger blocks of cards.
Findings
Provides a new method for bounding mixing times using pair interactions.
Offers potential improvements over traditional block-based approaches.
Applicable to random walks with partial symmetries.
Abstract
We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of cards which may be in any order, we wait for pairs of cards to `interact', and bound the mixing time by the time taken for enough interactions to occur.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Theoretical and Computational Physics
