A recursive algorithm for computing the distribution of the number of successes in higher-order Markovian trials

DOI10.1016/J.CSDA.2004.09.005zbMath1431.60081OpenAlexW2040357216MaRDI QIDQ959188

Donald E. K. Martin

Publication date: 11 December 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2004.09.005

zbMATH Keywords

probabilityMarkovian sequencesbinary trials

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Related Items (1)

A combinatorial approach in predicting the outcome of tennis matches

Cites Work

• Unnamed Item
• Unnamed Item
• On number of occurrences of success runs of specified length in a higher-order two-state Markov chain
• On the distribution of the number of successes in fourth- or lower-order Markovian trials
• THE DISTRIBUTION OF THE NUMBER OF SUCCESSES IN A SEQUENCE OF DEPENDENT TRIALS
• An Algorithm for the Binomial Distribution with Dependent Trials
• Applications of an algorithm for the distribution of the number of successes in fourth-order Markovian sequences.

This page was built for publication: A recursive algorithm for computing the distribution of the number of successes in higher-order Markovian trials