Tight Markov chains and random compositions

From MaRDI portal
Publication:439877

DOI10.1214/11-AOP656zbMATH Open1257.05009arXiv1005.1957OpenAlexW2963390441MaRDI QIDQ439877FDOQ439877


Authors: Boris Pittel Edit this on Wikidata


Publication date: 17 August 2012

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: For an ergodic Markov chain X(t) on BbbN, with a stationary distribution pi, let Tn>0 denote a hitting time for [n]c, and let Xn=X(Tn). Around 2005 Guy Louchard popularized a conjecture that, for noinfty, Tn is almost Geometric(p), p=pi([n]c), Xn is almost stationarily distributed on [n]c, and that Xn and Tn are almost independent, if p(n):=supip(i,[n]c)o0 exponentially fast. For the chains with p(n)o0 however slowly, and with supi,j,|p(i,cdot)p(j,cdot)|TV<1, we show that Louchard's conjecture is indeed true even for the hits of an arbitrary SnsubsetBbbN with pi(Sn)o0. More precisely, a sequence of k consecutive hit locations paired with the time elapsed since a previous hit (for the first hit, since the starting moment) is approximated, within a total variation distance of order k,supip(i,Sn), by a k-long sequence of independent copies of (elln,tn), where elln=extGeometric,(pi(Sn)), tn is distributed stationarily on Sn, and elln is independent of tn. The two conditions are easily met by the Markov chains that arose in Louchard's studies as likely sharp approximations of two random compositions of a large integer u, a column-convex animal (cca) composition and a Carlitz (C) composition. We show that this approximation is indeed very sharp for most of the parts of the random compositions. Combining the two approximations in a tandem, we are able to determine the limiting distributions of mu=o(lnu) and mu=o(u1/2) largest parts of the random cca composition and the random C-composition, respectively. (Submitted to Annals of Probability in August, 2009.)


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Tight Markov chains and random compositions

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