Convergence rates of Markov chains on spaces of partitions

From MaRDI portal
Publication:388938

DOI10.1214/EJP.V18-2389zbMATH Open1296.60183arXiv1209.4918MaRDI QIDQ388938FDOQ388938


Authors: Harry Crane, Steven P. Lalley Edit this on Wikidata


Publication date: 17 January 2014

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic matrices, which describe the chain induced on the simplex by taking asymptotic frequencies. Using this representation, we establish upper bounds for the mixing times of ergodic cut-and-paste chains, and under certain conditions on the distribution of the governing random matrices we show that the "cutoff phenomenon" holds.


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




Recommendations





Cited In (9)





This page was built for publication: Convergence rates of Markov chains on spaces of partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388938)