pith. sign in

arxiv: 1805.10362 · v2 · pith:EBEWIPQEnew · submitted 2018-05-25 · 🧮 math-ph · math.MP

Time-inhomogeneous random Markov chains

classification 🧮 math-ph math.MP
keywords randomcolumnsmarkovspectrumchainsdistributionlargelargest
0
0 comments X
read the original abstract

We consider Markov chains with random transition probabilities which, moreover, fluctuate randomly with time. We describe such a system by a product of stochastic matrices, $U(t)=M_t\cdots M_1$, with the factors $M_i$ drawn independently from an ensemble of random Markov matrices, whose columns are independent Dirichlet random variables. The statistical properties of the columns of $U(t)$, its largest eigenvalue and its spectrum are obtained exactly for $N=2$ and numerically investigated for general $N$. For large $t$, the columns are Dirichlet-distributed, however the distribution is different from the initial one. As for the spectrum, we find that the eigenvalues converge to zero exponentially fast and investigate the statistics of the largest Lyapunov exponent, which is well approximated the a Gamma distribution. We also observe a concentration of the spectrum on the real line for large $t$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.