Waiting time problems in a two-state Markov chain

被引：11

作者：

Han, Q ^{[1
]}

Aki, S ^{[1
]}

机构：

[1] Osaka Univ, Grad Sch Engn Sci, Dept Informat & Math Sci, Toyonaka, Osaka 5608531, Japan

来源：

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS | 2000年 / 52卷 / 04期

关键词：

waiting time problems; discrete distributions of order k; Markov chain; Markov chain imbedding method; probability generating function;

D O I：

10.1023/A:1017537629251

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

Let F-0 be the event that l(0) 0-runs of length k(0) occur and F-1 be the event that l(1) 1-runs of length k(1) occur in a two-state Markov chain. In this paper using a combinatorial method and the Markov chain imbedding method, we obtained explicit formulas of the probability generating functions of the sooner and later waiting time between F-0 and F-1 by the non-overlapping, overlapping and "greater than or equal" enumeration scheme. These formulas are convenient for evaluating the distributions of the sooner and later waiting time problems.

引用

页码：778 / 789

页数：12

共 50 条

[21] A generalized binomial distribution determined by a two-state Markov chain and a distribution by the Bayesian approach
M. Akahira
H. Kashima
K. Takahashi
Statistical Papers, 1997, 38 : 27 - 42
[22] Two-State Imprecise Markov Chains for Statistical Modelling of Two-State Non-Markovian Processes
Troffaes, Matthias C. M.
Krak, Thomas
Bains, Henna
PROCEEDINGS OF THE ELEVENTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES: THEORIES AND APPLICATIONS (ISIPTA 2019), 2019, 103 : 394 - 403
[23] Approximate analytical solutions for two-state time-dependent problems
Burrows, BL
Moideen, FM
Amos, AT
INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1999, 74 (05) : 559 - 571
[24] Asymptotic study of an estimator of the entropy rate of a two-state Markov chain for one long trajectory
Girardin, Valerie
Sesboue, Andre
BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, 2006, 872 : 403 - +
[25] Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain
Han, Q
Aki, S
STATISTICS & PROBABILITY LETTERS, 1998, 40 (03) : 203 - 214
[26] Turbo decoding over a two-state Markov channel
Vanichchanunt, P
Wuttisittikulkij, L
Nakpeerayuth, S
GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 554 - 558
[27] Evolutionary trees can be learned in polynomial time in the two-state general Markov model
Cryan, M
Goldberg, LA
Goldberg, PW
SIAM JOURNAL ON COMPUTING, 2001, 31 (02) : 375 - 397
[28] Evolutionary trees can be learned in polynomial time in the two-state general Markov model
Cryan, M
Goldberg, LA
Goldberg, PW
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 436 - 445
[29] On the Longest Run and the Waiting Time for the First Run in a Continuous Time Multi-State Markov Chain
Vaggelatou, Eutichia
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2024, 26 (04)
[30] On state-estimation of a two-state hidden Markov model with quantization
Shue, L
Dey, S
Anderson, BDO
De Bruyne, F
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2001, 49 (01) : 202 - 208

← 1 2 3 4 5 →