Compound patterns and generating functions: from basic waiting times to counts of occurrence

DOI10.1016/J.JSPI.2011.01.010MaRDI QIDQ2431573zbMATH OpenOpenAlexFDO

Authors Valeri T. Stefanov

Publication date 15 April 2011

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

Full work available at URL https://doi.org/10.1016/j.jspi.2011.01.010

zbMATH Keywords

generating functionstopping timepatternsemi-Markov process

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Markov renewal processes, semi-Markov processes (60K15)

Recommendations

• On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
• On waiting time distributions associated with compound patterns in a sequence of multi-state trials
• Distribution of waiting time until the \(r\)th occurrence of a compound pattern
• On generating functions of waiting time problems for sequence patterns of discrete random variables
• Waiting times for patterns in a sequence of multistate trials

Cites work

• scientific article; zbMATH DE number 1058063 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Exact distributions for reward functions on semi-Markov and Markov additive processes
• On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
• On a waiting time distribution in a sequence of Bernoulli trials
• On some waiting time problems
• On waiting time distributions associated with compound patterns in a sequence of multi-state trials
• Runs and scans with applications
• Special issue: Average-case analysis of algorithms
• Waiting time distributions associated with runs of fixed length in two-state Markov chains

Cited in

(2)

• Exact and asymptotic results for pattern waiting times
• On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials

This page was built for publication: Compound patterns and generating functions: from basic waiting times to counts of occurrence

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