On mean recurrence times of Markov chains and spanning tree invariants
✍ Scribed by Ricardo Gómez
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 141 KB
- Volume
- 433
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
We show that the mean recurrence times of (countable state) irreducible and positively recurrent Markov chains are the spanning tree invariants of the first return loop systems. Then, by the Perron-Frobenius Theorem, the spanning tree invariants of the first return loop systems of a finite state Markov chain are all equal if and only if the process is doubly stochastic, settling a conjecture on a question in G ómez and Salazar-Montiel (2010) [1] where it was verified for matrices of size at most three.
📜 SIMILAR VOLUMES
A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain. Another problem is that of generating a random spanning tree of a graph or spanning arborescence of a d
Multi-wave panel data are observations at two or more points in time on a continuously changing attribute of interest (e.g. behaviour). In this paper, the adequacy of the continuous-time homogeneous Markov chain (CTHMC) model is assessed for describing the process of change underlying such data. In
HLA-A,B,C and HLA-DR molecules are involved in cognate LFA-3 (CD58) in antigen-independent T-celVtarget-cell interaction. T-cell-mediated host-versus-tumor response might therefore depend on the presence of both types of molecules on the surface of the target cell. To investigate whether presence or