𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A non-recursive algorithm for classifying the states of a finite Markov chain

✍ Scribed by Howard J. Weiss

Book ID
107991860
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
170 KB
Volume
28
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Markov property of a finite hidde
On the Markov property of a finite hidden Markov chain
✍ Peter Spreij πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 119 KB

In this paper we study the question of the conditions under which a hidden Markov chain itself exhibits Markovian behaviour. An insightful method to answer this question is based on a recursive ΓΏltering formula for the underlying chain.

Joint Distributions of the Numbers of Vi
Joint Distributions of the Numbers of Visits for Finite-State Markov Chains
✍ Wolfgang Stadje πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 163 KB

For a discrete-time Markov chain with finite state space [1, ..., r] we consider the joint distribution of the numbers of visits in states 1, ..., r&1 during the first N steps or before the N th visit to r. From the explicit expressions for the corresponding generating functions we obtain the limiti