Quantitative merging for time-inhomogeneous Markov chains in non-decreasing environments via functional inequalities
Abstract
We study time-inhomogeneous Markov chains to obtain quantitative results on their asymptotic behavior. We use Poincaré, Nash, and logarithmic-Sobolev inequalities. We assume that our Markov chain admits a finite invariant measure at each time and that the sequence of these invariant measures is non-decreasing. We deduce quantitative bounds on the merging time of the distributions for the chain started at two arbitrary points and we illustrate these new results with examples.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.