Large deviations for a class of nonhomogeneous Markov chains
Zach Dietz, Sunder Sethuraman
Abstract
Large deviation results are given for a class of perturbed nonhomogeneous Markov chains on finite state space which formally includes some stochastic optimization algorithms. Specifically, let Pn be a sequence of transition matrices on a finite state space which converge to a limit transition matrix P. Let Xn be the associated nonhomogeneous Markov chain where Pn controls movement from time n-1 to n. The main statements are a large deviation principle and bounds for additive functionals of the nonhomogeneous process under some regularity conditions. In particular, when P is reducible, three regimes that depend on the decay of certain ``connection'' Pn probabilities are identified. Roughly, if the decay is too slow, too fast or in an intermediate range, the large deviation behavior is trivial, the same as the time-homogeneous chain run with P or nontrivial and involving the decay rates. Examples of anomalous behaviors are also given when the approach Pn P is irregular. Results in the intermediate regime apply to geometrically fast running optimizations, and to some issues in glassy physics.
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson