Simple bounds on the convergence rate of an ergodic Markov chain

DOI10.1016/0020-0190(93)90220-4zbMath0765.60069OpenAlexW2048593583WikidataQ128030217 ScholiaQ128030217MaRDI QIDQ1209327

Tiko Kameda, Slawomir Pilarski

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90220-4

zbMATH Keywords

transition probability matrixanalysis of algorithmsconvergence rate of an ergodic Markov chain

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Eigenvalues and expanders
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Time bounds for selection
• Shuffling Cards and Stopping Times
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item