An algorithm to compute the probability of a run in binary fourth-order Markovian trials.
type: Item
instance of: scholarly article
title: An algorithm to compute the probability of a run in binary fourth-order Markovian trials.
zbMATH Open document ID: 1043.62120
DOI: 10.1016/S0305-0548(02)00026-6
author: Donald E. K. Martin
published in: Computers \& Operations Research
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 62P99
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1910182
zbMATH Keywords: Binary trials
zbMATH Keywords: Markovian sequences
zbMATH Keywords: Run probability
MaRDI profile type: Publication
cites work: On the Theory of Runs with some Applications to Quality Control
cites work: Run Probabilities in Sequences of Markov-Dependent Trials
cites work: Q3998259
cites work: THE DISTRIBUTION OF THE NUMBER OF SUCCESSES IN A SEQUENCE OF DEPENDENT TRIALS
cites work: An Algorithm for the Binomial Distribution with Dependent Trials
cites work: Q3859149
cites work: On the distribution of the number of successes in fourth- or lower-order Markovian trials
cites work: The reliability of a large series system under Markov structure
cites work: Distributions of numbers of failures and successes until the first consecutive \(k\) successes
cites work: Waiting time distributions associated with runs of fixed length in two-state Markov chains
cites work: Distribution Theory of Runs: A Markov Chain Approach
cites work: Q4715955
cites work: Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
cites work: Statistical Inference about Markov Chains
cites work: Start-up demonstration tests under Markov dependence model with corrective actions
cites work: Statistical inference in Bernoulli trials with dependence
full work available at URL: s0305-0548(02)00026-6
OpenAlex ID: W2013252852
Recommended article: Applications of an algorithm for the distribution of the number of successes in fourth-order Markovian sequences.
Recommended article: A recursive algorithm for computing the distribution of the number of successes in higher-order Markovian trials
Recommended article: A combinatorial approach to calculation of moments of characteristics of runs in ternary Markov sequences
Recommended article: On the distribution of the number of successes in fourth- or lower-order Markovian trials
Recommended article: Central limit theorem approximations for the number of runs in Markov-dependent binary sequences
Recommended article: Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials
Recommended article: Developments of the Markov chain approach within the distribution theory of runs.
Recommended article: On an algorithm for calculating stationary probabilities of the Markov chains
Recommended article: Q4277596
description: scientific article; zbMATH DE number 1910182