Occupation laws for some time-nonhomogeneous Markov chains

From MaRDI portal
Publication:2461985

DOI10.1214/EJP.V12-413zbMATH Open1127.60068arXivmath/0701798MaRDI QIDQ2461985FDOQ2461985

Sunder Sethuraman, Zach Dietz

Publication date: 23 November 2007

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

Abstract: We consider finite-state time-nonhomogeneous Markov chains where the probability of moving from state i to state jeqi at time n is G(i,j)/nzeta for a ``generator matrix G and strength parameter zeta>0. In these chains, as time grows, the positions are less and less likely to change, and so form simple models of age-dependent time-reinforcing behaviors. These chains, however, exhibit some different, perhaps unexpected, asymptotic occupation laws depending on parameters. Although on the one hand it is shown that the asymptotic position converges to a point-mixture for all zeta>0, on the other hand, the average position, when variously 0<zeta<1, zeta>1 or zeta=1, is shown to converges to a constant, a point-mixture, or a distribution muG with no atoms and full support on a certain simplex respectively. The last type of limit can be seen as a sort of ``spreading between the cases 0<zeta<1 and zeta>1. In particular, when G is appropriately chosen, muG is a Dirichlet distribution with certain parameters, reminiscent of results in Polya urns.


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






Cited In (9)






This page was built for publication: Occupation laws for some time-nonhomogeneous Markov chains

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