Empirical Measure Large Deviations for Reinforced Chains on Finite Spaces
Abstract
Let A be a transition probability kernel on a finite state space o =\1, … , d\ such that A(x,y)>0 for all x,y ∈ o. Consider a reinforced chain given as a sequence \Xn, \; n ∈ N0\ of o-valued random variables, defined recursively according to, Ln = 1nΣi=0n-1 δXi, \;\; P(Xn+1 ∈ · X0, …, Xn) = Ln A(·). We establish a large deviation principle for \Ln\. The rate function takes a strikingly different form than the Donsker-Varadhan rate function associated with the empirical measure of the Markov chain with transition kernel A and is described in terms of a novel deterministic infinite horizon discounted cost control problem with an associated linear controlled dynamics and a nonlinear running cost involving the relative entropy function. Proofs are based on an analysis of time-reversal of controlled dynamics in representations for log-transforms of exponential moments, and on weak convergence methods.
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.