Waiting time distributions of competing patterns in higher-order Markovian sequences
Waiting time distributions of competing patterns in higher-order Markovian sequences
复制标题
DOI：
10.1239/jap/1134587810
复制
发表时间：
2005-12
影响因子：
1
通讯作者：
J. Aston;D. Martin
中科院分区：
文献类型：
--
作者：
J. Aston;D. Martin
竞争模式是一种复合模式，它会竞争第一个出现特定于模式的次数。他们代表了一个概括的更快的等待时间的问题和启动演示测试的验收和拒绝标准。通过有限马尔可夫链嵌入，竞争模式的等待时间分布的多态试验，是马尔可夫的一般秩序。还得到了每个特定的竞争模式将是第一个出现其各自的规定次数的概率，在有限的时间和限制。
Competing patterns are compound patterns that compete to be the first to occur pattern-specific numbers of times. They represent a generalisation of the sooner waiting time problem and of start-up demonstration tests with both acceptance and rejection criteria. Through the use of finite Markov chain imbedding, the waiting time distribution of competing patterns in multistate trials that are Markovian of a general order is derived. Also obtained are probabilities that each particular competing pattern will be the first to occur its respective prescribed number of times, both in finite time and in the limit.