Waiting times for patterns in a sequence of multistate trials
Let \((X_n,n\geq 1)\) be a sequence of trials taking values in a given finite set \(A\). A simple pattern is defined to be a finite sequence of outcomes from \(A\) and a compound pattern is defined to be a union of distinct simple patterns. Patterns will be denoted by (simple or compound) \({\mathcal E}\) and let \(X_{r,{\mathcal E}}\) be a random variable denoting the waiting time for the \(r\)th occurrence of \({\mathcal E}\). There are a number of papers dealing with the study of \(X_{r,{\mathcal E}}\) and related problems. The present article develops a variation of finite Markov chain embedding method for the derivation of the probability mass and probability generating functions of \(X_{r,{\mathcal E}}\) in the non-overlapping and the overlapping way of counting runs and patterns. Several extensions and generalizations are discussed. NEWLINENEWLINENEWLINEFor related papers see: \textit{D. L. Antzoulakos} [Ann. Inst. Stat. Math. 51, No. 2, 323-330 (1999; Zbl 0949.60085)], \textit{J. C. Fu} [Stat. Sin. 6, No. 4, 957-974 (1996; Zbl 0857.60068)] and \textit{M. V. Koutras} [Ann. Inst. Stat. Math. 49, No. 1, 123-139 (1997; Zbl 0913.60019)].
- On waiting time distributions for patterns in a sequence of multistate trials
- Distribution of waiting time until the \(r\)th occurrence of a compound pattern
- On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
- Waiting time distribution of generalized later patterns
- Recursive equations in finite Markov chain imbedding
- Waiting time distribution of generalized later patterns
- On occurrence of subpattern and method of gambling teams
- Waiting time problem for an almost perfect match.
- Waiting times and stopping probabilities for patterns in Markov chains
- Start-up demonstration tests with three-level classification
- Exact distributions of constrained (k, ) strings of failures between subsequent successes
- Recursive equations in finite Markov chain imbedding
- The analysis and comparison of start-up demonstration tests
- Compound patterns and generating functions: from basic waiting times to counts of occurrence
- Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials
- Distribution of waiting time until the \(r\)th occurrence of a compound pattern
- On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials
- Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns
- On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- More on Waiting Times
- scientific article; zbMATH DE number 4138892 (Why is no real title available?)
- Joint Distributions Associated with Compound Patterns in a Sequence of Markov Dependent Multistate Trials and Estimation Problems
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
- Chi-square control charts with runs rules
- Exact and asymptotic results for pattern waiting times
- scientific article; zbMATH DE number 1058063 (Why is no real title available?)
- On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials
- Distributions of patterns of two successes separated by a string of k-2 failures
- On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- scientific article; zbMATH DE number 806876 (Why is no real title available?)
- Runs rules schemes for monitoring process variability
- Monitoring exponential data using two-sided control charts with runs rules
- Distributions of simple patterns in some kinds of exchangeable sequences
- On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
- The ModifiedrOut ofmControl Chart
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Waiting time distributions of competing patterns in higher-order Markovian sequences
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
- On waiting time distributions for patterns in a sequence of multistate trials
- Minimum and maximum distances between failures in binary sequences
- Start-up demonstration tests: models, methods and applications, with some unifications
- Improved chi-square control charts with weak-run rules
- Computation of exact probabilities associated with overlapping pattern occurrences
- Counting certain binary strings
- On waiting time distributions associated with compound patterns in a sequence of multi-state trials
- A martingale approach to scan statistics
- Improving the performance of the chi-square control chart via runs rules
- A direct method to obtain the joint distribution of successes, failures and patterns in enumeration problems
- Distribution of runs in a sequence of exchangeable multi-state trials
- On occurrence of patterns in Markov chains: Method of gambling teams
This page was built for publication: Waiting times for patterns in a sequence of multistate trials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2748443)
