Compound Poisson approximation for multiple runs in a Markov chain
Let \((X_i)\) be a stationary Markov chain with \(r\)-valued terms. Consider the runs of \(k_i\) \((i = 1,\dots,r)\) consecutive random variables having value \(i\), that end in the finite sequence \(X_1,\dots,X_n\). Then the random variable \(W=\sum^n_{a=1} \sum^r_{i=1} I[(X_{a-k+1},\dots,X_a)=(i,\dots,i)]\) enumerates the overlapping run. Here \(I\) denotes the indicator. The aim of the paper is to estimate the approximation of \(W\)-distribution by compound Poisson; the so called waiting time \(T_k\), i.e. the number of trials until the \(k\)th run appearance \(P(T_k>n)=P(W<k)\), is shown for large \(k\).
- Poisson approximation for the number of non-decreasing runs in Markov chains
- Waiting time distributions of runs in higher order Markov chains
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- Waiting time distributions associated with runs of fixed length in two-state Markov chains
- Poisson type approximations for the Markov binomial distribution
- On the probability of existence of substrings with the same structure in a random sequence
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- Compound Poisson approximation
- Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
- Poisson approximation for the number of non-decreasing runs in Markov chains
- Compound Poisson approximations for word patterns under Markovian hypotheses
- ESTIMATOR FOR THE DISTRIBUTION OF THE NUMBERS OF RUNS IN A RANDOM SEQUENCE CONTROLLED BY STATIONARY MARKOV CHAIN
- On the limit distribution of a number of runs in polynomial sequence controlled by Markov chain
- Compound Poisson and signed compound Poisson approximations to the Markov binomial law
- A lower bound for the reliability function of multiple failure mode systems
This page was built for publication: Compound Poisson approximation for multiple runs in a Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868302)