Sooner and later waiting time problems based on a dependent sequence

DOI10.1023/A:1004182030590MaRDI QIDQ5926198zbMATH OpenFDO

Authors Qing Han, Sigeo Aki

Publication date 13 November 2001

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1004182030590

zbMATH Keywords

probability functionprobability generating functionbinary sequence of order \(k\)sooner and later waiting time problemsbinary sequence of order \((k,r)\)

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Recommendations

• Sooner and later waiting time problems for patterns in Markov dependent trials
• Waiting time problems for a sequence of discrete random variables
• Sooner and later waiting time problems in a two-state Markov chain
• scientific article; zbMATH DE number 846009
• A generalization of a waiting time problem

Cited in

(4)

• scientific article; zbMATH DE number 1526060 (Why is no real title available?)
• A generalization of the classical secretary problem: dependent arrival sequences
• Joint distributions of runs in a sequence of higher-order two-state Markov trials
• Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials

This page was built for publication: Sooner and later waiting time problems based on a dependent sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926198)