On k-match problems

DOI10.1016/S0378-3758(02)00299-9MaRDI QIDQ1866252zbMATHFDO

Authors Katuomi Hirano, Sigeo Aki

Publication date 3 April 2003

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

Markov chainprobability generating functionwaiting timeduplicationdiscrete distributionurn model

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Characteristic functions; other transforms (60E10)

Recommendations

• Waiting time problem for an almost perfect match.
• Generalized \(k\)-matches
• Waiting time for consecutive repetitions of a pattern and related distributions
• On waiting time problems associated with runs in Markov dependent trials
• THE MEAN WAITING TIME FOR A PATTERN

Cites work

• scientific article; zbMATH DE number 3784098 (Why is no real title available?)
• A Poisson approximation for the number of \(k\)-matches
• Approximations to the birthday problem with unequal occurrence probabilities and their application to the surname problem in Japan
• Generalized \(k\)-matches
• Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
• The waiting time until first duplication
• Waiting time problems for a sequence of discrete random variables

Cited in

(8)

• Waiting time distributions for a run with additional constraints
• scientific article; zbMATH DE number 1341910 (Why is no real title available?)
• scientific article; zbMATH DE number 19225 (Why is no real title available?)
• scientific article; zbMATH DE number 4197736 (Why is no real title available?)
• Waiting time problem for an almost perfect match.
• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• On the Problem of Multiple Matching
• Generalized \(k\)-matches

This page was built for publication: On \(k\)-match problems

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