An algorithm to compute the probability of a run in binary fourth-order Markovian trials.

DOI10.1016/S0305-0548(02)00026-6zbMath1043.62120OpenAlexW2013252852MaRDI QIDQ1870809

Donald E. K. Martin

Publication date: 14 May 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00026-6

zbMATH Keywords

Binary trialsMarkovian sequencesRun probability

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Applications of statistics (62P99)

Related Items (3)

Computer aided solving the high-order transition probability matrix of the finite Markov chain ⋮ Markovian start-up demonstration tests with rejection of units upon observing \(d\) failures. ⋮ Hot-hand effects in sports and a recursive method of computing probabilities for streaks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributions of numbers of failures and successes until the first consecutive \(k\) successes
• Waiting time distributions associated with runs of fixed length in two-state Markov chains
• Start-up demonstration tests under Markov dependence model with corrective actions
• Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
• On the distribution of the number of successes in fourth- or lower-order Markovian trials
• Statistical inference in Bernoulli trials with dependence
• Statistical Inference about Markov Chains
• THE DISTRIBUTION OF THE NUMBER OF SUCCESSES IN A SEQUENCE OF DEPENDENT TRIALS
• The reliability of a large series system under Markov structure
• An Algorithm for the Binomial Distribution with Dependent Trials
• Distribution Theory of Runs: A Markov Chain Approach
• Run Probabilities in Sequences of Markov-Dependent Trials
• On the Theory of Runs with some Applications to Quality Control

This page was built for publication: An algorithm to compute the probability of a run in binary fourth-order Markovian trials.