文章基本信息

标题：Mixing under monotone censoring
本地全文：下载
作者：Ding, Jian ; Mossel, Elchanan
期刊名称：Electronic Communications in Probability
印刷版ISSN：1083-589X
出版年度：2014
卷号：19
页码：1-6
DOI：10.1214/ECP.v19-3157
语种：English
出版社：Electronic Communications in Probability
摘要：We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain $M$ on a state space $\Omega$ with stationary distribution $\pi$ and a monotone set $A \subset \Omega$. We consider the chain $M'$ which is the same as the chain $M$ started at some $x \in A$ except that moves of $M$ of the form $x \to y$ where $x \in A$ and $y \notin A$ are {\em censored} and replaced by the move $x \to x$. If $M$ is ergodic and $A$ is connected, the new chain converges to $\pi$ 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.
关键词：mixing time; testing monotonicity.;60G15, 60G70