✦ LIBER ✦

On the length of the longest run in a multi-state Markov chain

✍ Scribed by Eutichia Vaggelatou

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 230 KB
Volume: 62
Category: Article
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(02)00432-7

No coin nor oath required. For personal study only.

✦ Synopsis

Let {X a } a∈Z be an irreducible and aperiodic Markov chain on a ÿnite state space S = {0;

📜 SIMILAR VOLUMES

On the length of the longest increasing

On the length of the longest increasing run in Rd

✍ Andrei N. Frolov; Alexander I. Martikainen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 407 KB

On the average run lengths of quality co

On the average run lengths of quality control schemes using a Markov chain approach

✍ James C. Fu; Fred A. Spiring; Hansheng Xie 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Control schemes such as cumulative sum (CUSUM), exponentially weighted moving average (EWMA) and Shewhart charts have found widespread application in improving the quality of manufactured goods and services. The run length and the average run length (ARL) have become traditional measures of a contro

Formulae and recursions for the joint di

Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain

✍ Qing Han; Sigeo Aki 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 530 KB

In this paper we obtain exact and recurrence formulae for the probability functions and the probability generating functions of Y, based on four different ways of counting numbers of success runs (i.e. overlapping success runs, non-overlapping runs, the runs with a specified length k or more and the

On the length of longest dominating cycl

On the length of longest dominating cycles in graphs

✍ Hoa Vu Dinh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length

On the joint distribution of runs in a s

On the joint distribution of runs in a sequence of multi-state trials

✍ Masayuki Doi; Eiji Yamamoto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 369 KB

The joint distribution of c kinds of success runs in a sequence of (c + 1 )-state trials is given by the finite Markov chain method proposed by Fu andKoutras (1994) andFu (1996). (~

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.