On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems
From MaRDI portal
Publication:6166020
DOI10.1007/S11203-022-09283-7arXiv2105.09536OpenAlexW4310750623MaRDI QIDQ6166020
Publication date: 6 July 2023
Published in: Statistical Inference for Stochastic Processes (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09536
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Statistical estimation of ergodic Markov chain kernel over discrete state space
- Concentration inequalities for Markov chains by Marton couplings and spectral methods
- An Automatic Inequality Prover and Instance Optimal Identity Testing
- Mathematical Aspects of Mixing Times in Markov Chains
- Deterministic approximation of the cover time
- Cover times, blanket times, and majorizing measures
- Inequalities: theory of majorization and its applications
This page was built for publication: On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems