✦ LIBER ✦

The expected hitting times for finite Markov chains

✍ Scribed by Haiyan Chen; Fuji Zhang

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 428
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sum rules for hitting times of Markov ch

Sum rules for hitting times of Markov chains

✍ José Luis Palacios; José M. Renom 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Markov chains with almost exponential hi

Markov chains with almost exponential hitting times

✍ David J. Aldous 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 522 KB

A note on expected hitting times for bir

A note on expected hitting times for birth and death chains

✍ JoséLuis Palacios; Prasad Tetali 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Hitting time in a finite non-homogeneous

Hitting time in a finite non-homogeneous Markov chain with applications

✍ Platis, A. ;Limnios, N. ;Le Du, M. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 3 views

This paper deals with the computation of the hitting time for a non-homogeneous discrete time Markov chain (NHDTMC or NHMC). We first give the basic definitions of NHMC, then we analyse the hitting time and its survivor function. We also give the sufficient conditions for the existence of the mean h

Expectations for Nonreversible Markov Ch

Expectations for Nonreversible Markov Chains

✍ I.H. Dinwoodie 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Bounds are given for an irreducible Markov chain on the probability that the time average of a functional on the state space exceeds its stationary expectation, without assuming reversibility. The bounds are in terms of the singular values of the discrete generator. ᮊ 1998 Academic Press The probab

Expected hitting times for a random walk

Expected hitting times for a random walk on a connected graph

✍ Gregory F Lawler 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 297 KB

A random walk on a graph is defined in which a particle moves from one vertex to any adjoining vertex, each with equal probability. The expected number of steps to get from one point to another is considered. It is shown that the maximum expectation for a graph with N vertices is O(N3). It is also s