Fetching the paper…
Reading the bibliography…
The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence.
“Exploration-exploitation Tradeoff using Variance Estimates in Multi-armed Bandits”
J.-Y. Audibert, R. Munos and . Szepesv“’ari · 1902
Earlier work this paper cites.
“Sur l’extension du theoreme limite du calcul des probabilites aux sommes de quantites dependantes”
S.N. Bernstein · 1927
Earlier work this paper cites.
“On tail probabilities for martingales”
D.A. Freedman · 1975
Earlier work this paper cites.
“The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains”
Carl. Meyer · 1975
Earlier work this paper cites.
“Perturbation bounds for the stationary probabilities of a finite Markov chain”
M. Haviv and L. Van der Heyden · 1984
Earlier work this paper cites.
“Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions”
C. Kipnis and S… Varadhan · 1986
Earlier work this paper cites.
“Matrix perturbation theory”
G.. Stewart and J. Sun · 1990
Earlier work this paper cites.
“Markov Chains and Stochastic Stability”
S.. Meyn and R.. Tweedie · 1993
Earlier work this paper cites.
“Sensitivity of finite Markov chains under perturbation”
E. Seneta · 1993
Earlier work this paper cites.
“Rates of convergence for empirical processes of stationary mixing sequences”
B. Yu · 1994
Earlier work this paper cites.
“A Chernoff bound for random walks on expander graphs”
David Gillman · 1998
Earlier work this paper cites.
“Applications of Paz’s inequality to perturbation bounds for Markov chains”
S.J. Kirkland, M. Neumann and B.L. Shader · 1998
Earlier work this paper cites.
“Reinforcement Learning: An Introduction (Adaptive Computation and Machine Learning)”
Richard. Sutton and Andrew. Barto · 1998
Earlier work this paper cites.
“Testing that distributions are close”
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren Smith and Patrick White · 2000
Earlier work this paper cites.
“Estimating the second largest eigenvalue of a Markov transition matrix”
Steven. Garren and Richard. Smith · 2000
Cited alongside, same era.
“Comparison of perturbation bounds for the stationary distribution of a Markov chain”
G.E. Cho and C.D. Meyer · 2001
Cited alongside, same era.
“Honest Exploration of Intractable Probability Distributions via Markov Chain Monte Carlo”
Galin. Jones and James. Hobert · 2001
Cited alongside, same era.
“An improvement on the perturbation of the group inverse and oblique projection”
Xiezhang Li and Yimin Wei · 2001
Cited alongside, same era.
“Monte Carlo Strategies in Scientific Computing”, Springer Series in Statistics
J.. Liu · 2001
Cited alongside, same era.
“Rates of uniform convergence of empirical means with mixing processes”
Rajeeva. Karandikar and Mathukumalli Vidyasagar · 2002
“Learning from dependent observations”
Ingo Steinwart, Don Hush and Clint Scovel · 2009
Later among the works it cites.
“The computational complexity of estimating MCMC convergence time”
Nayantara Bhatnagar, Andrej Bogdanov and Elchanan Mossel · 2011
Later among the works it cites.
“Implementing MCMC: estimating with confidence”
James Flegal and Galin Jones · 2011
Later among the works it cites.
“Estimating beta-mixing coefficients”
D.J. McDonald, C.R. Shalizi and M.J. Schervish · 2011
Later among the works it cites.
“On the continuity of the group inverse”
Julio Ben“’tez and Xiaoji Liu · 2012
Later among the works it cites.
“Testing closeness of discrete distributions”
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren Smith and Patrick White · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Extension of the PAC framework to finite and countable Markov chains”
David Gamarnik · 2003
Cited alongside, same era.
“Introduction to statistical learning theory”
O. Bousquet, S. Boucheron and G. Lugosi · 2004
Cited alongside, same era.
“Optimal Hoeffding bounds for discrete reversible Markov chains”
Carlos Le“’on and Francois Perron · 2004
Cited alongside, same era.
“Exponential bounds and stopping rules for MCMC and general Markov chains”
Ioannis Kontoyiannis, Luis Lastras-Monta“˜no and Sean. Meyn · 2006
Cited alongside, same era.
“Mathematical Aspects of Mixing Times in Markov Chains”
R. Montenegro and P. Tetali · 2006
Cited alongside, same era.
“Stability bounds for non-iid processes”
M. Mohri and A. Rostamizadeh · 2008
Cited alongside, same era.
B.. Gyori and D. Paulin · 2014
Later among the works it cites.
“Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes”
Aryeh Kontorovich and Roi Weiss · 2014
Later among the works it cites.
“Testing Closeness With Unequal Sized Samples”
Bhaswar. Bhattacharya and Gregory Valiant · 2015
Later among the works it cites.
“Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path”
Daniel Hsu, Aryeh Kontorovich and aba Szepesv“’ari · 2015
Later among the works it cites.
“Concentration inequalities for Markov chains by Marton couplings and spectral methods”
Daniel Paulin · 2015
Later among the works it cites.
“An Introduction to Matrix Concentration Inequalities”
J.A. Tropp · 2015
Later among the works it cites.
“Markov chain Monte Carlo confidence intervals”
Yves. Atchad“’e · 2016
Later among the works it cites.
“Estimating the Spectral Gap of a Reversible Markov Chain from a Short Trajectory”, 2016
David. Levin and Yuval Peres · 2016
Later among the works it cites.