Waiting time distributions associated with runs of fixed length in two-state Markov chains
From MaRDI portal
Publication:1370534
DOI10.1023/A:1003118807148zbMath0913.60019MaRDI QIDQ1370534
Publication date: 26 October 1997
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
negative binomial distributionswaiting time distributionssuccess runsdistributions of order \(k\)Markov dependent trials
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distribution theory (60E99)
Related Items (24)
A UNIFIED APPROACH TO GENERATING FUNCTIONS BASED ON BELL POLYNOMIALS ⋮ On the distribution of the total number of run lengths ⋮ Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials ⋮ Run and frequency quotas in a multi-state markov chain ⋮ Quotas on runs of successes and failures in a multi-state markov chain ⋮ On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials ⋮ Improving the performance of the chi-square control chart via runs rules ⋮ Compound geometric distribution of order \(k\) ⋮ On discrete Gibbs measure approximation to runs ⋮ Generalizations of distributions related to \((k_1,k_2)\)-runs ⋮ The distribution of extended discrete random sums and its application to waiting time distributions ⋮ Compound patterns and generating functions: from basic waiting times to counts of occurrence ⋮ Bivariate Fibonacci polynomials of order \(k\) with statistical applications ⋮ Distributions associated with \((k_1,k_2)\) events on semi-Markov binary trials ⋮ Distribution of the length of the longest common subsequence of two multi-state biological sequences ⋮ Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials ⋮ Decoupling combinatorial complexity: a two-step approach to distributions of runs ⋮ On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials ⋮ On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials ⋮ Bivariate Markov chain embeddable variables of polynomial type ⋮ Waiting Times and Number of Appearances of Runs: A Unified Approach ⋮ Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems ⋮ Design of multiple run sampling plan ⋮ An algorithm to compute the probability of a run in binary fourth-order Markovian trials.
This page was built for publication: Waiting time distributions associated with runs of fixed length in two-state Markov chains
