Mixing under monotone censoring
From MaRDI portal
Publication:457802
DOI10.1214/ECP.V19-3157zbMATH Open1317.60087arXiv1311.5945MaRDI QIDQ457802FDOQ457802
Authors: Jian Ding, Elchanan Mossel
Publication date: 29 September 2014
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Abstract: We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain on a state space with stationary distribution and a monotone set . We consider the chain which is the same as the chain started at some except that moves of of the form where and are {em censored} and replaced by the move . If is ergodic and is connected, the new chain converges to conditional on . In this paper we are interested in the mixing time of the chain in terms of properties of and . Our results are based on new connections with the field of property testing. A number of open problems are presented.
Full work available at URL: https://arxiv.org/abs/1311.5945
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cited In (1)
This page was built for publication: Mixing under monotone censoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457802)