Mixing under monotone censoring
Abstract
We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain M on a state space with stationary distribution π and a monotone set A ⊂ . We consider the chain M' which is the same as the chain M started at some x ∈ A except that moves of M of the form x y where x ∈ A and y A are censored and replaced by the move x x. If M is ergodic and A is connected, the new chain converges to π conditional on A. In this paper we are interested in the mixing time of the chain M' in terms of properties of M and A. Our results are based on new connections with the field of property testing. A number of open problems are presented.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.