On k-match problems

DOI10.1016/S0378-3758(02)00299-9zbMATH Open1016.60015MaRDI QIDQ1866252FDOQ1866252

Authors: Katuomi Hirano, Sigeo Aki 

Publication date: 3 April 2003

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

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

zbMATH Keywords

Markov chainprobability generating functionwaiting timeduplicationdiscrete distributionurn model

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Waiting time problem for an almost perfect match.
• Waiting time distributions for a run with additional constraints
• Title not available (Why is that?)
• On the Problem of Multiple Matching
• Title not available (Why is that?)
• Title not available (Why is that?)

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)