Pillai, NateshSmith, Aaron2022-10-312017-09Pillai, Natesh, Aaron Smith. "Elementary bounds on mixing times for decomposable Markov chains." Stochastic Processes and their Applications 127, no. 9 (2017): 3068-3109. DOI: 10.1016/j.spa.2017.02.0020304-4149https://nrs.harvard.edu/URN-3:HUL.INSTREPOS:37373463Many finite-state reversible Markov chains can be naturally decomposed into “projection” and “restriction” chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties of these related chains. This paper is in the tradition of existing bounds on Poincar ́e and log-Sobolev constants of Markov chains in terms of similar decompositions [JSTV04, MR02, MR06, MY09]. Our proofs are simple, relying largely on recent results relating hitting and mixing times of reversible Markov chains [PS13, Oli12]. We describe situations in which our results give substantially better bounds than those obtained by applying existing decomposition results and provide examples for illustration.en-USApplied MathematicsModeling and SimulationStatistics and ProbabilityElementary bounds on mixing times for decomposable Markov chainsJournal Article2018-01-2620172022-10-3110.1016/j.spa.2017.02.002