Mixing under monotone censoring

DOI10.1214/ECP.V19-3157MaRDI QIDQ457802zbMATHFDO

Authors Jian Ding, Elchanan Mossel

Publication date 29 September 2014

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.5945

zbMATH Keywords

Markov chainsmixing timesrhombuscritical percolationhexagonal latticemonotone censoring

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

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 $Omega$ with stationary distribution $pi$ and a monotone set $AsubsetOmega$. We consider the chain $M^{\prime }$ which is the same as the chain $M$ started at some $xinA$ except that moves of $M$ of the form $xoy$ where $xinA$ and $yotinA$ are {em censored} and replaced by the move $xox$. 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^{\prime }$ 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.

Recommendations

• Mixing time of Markov chains for the 1-2 model
• Some circumstances where extra updates can delay mixing
• scientific article; zbMATH DE number 1195779
• Mixing times of lozenge tiling and card shuffling Markov chains
• Mixing time for the solid-on-solid model

Cited in

(1)

• Concentration properties of restricted measures with applications to non-Lipschitz functions

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)