Pseudo-binomial approximation to (k₁, k₂)-runs
From MaRDI portal
Publication:722650
Abstract: ()-runs have received a special attention in the literature and its distribution can be obtained using combinatorial method (Huang and Tsai) and Markov chain approach (Dafnis et al). But the formulae are difficult to use when the number of Bernoulli trials is too large under identical setup and is generally intractable under non-identical setup. So, it is useful to approximate it with a suitable random variable. In this paper, it is demonstrated that pseudo-binomial is most suitable distribution for approximation and the approximation results are derived using Stein's method. Also, application of these results is demonstrated through real-life problems. It is shown that the bounds obtained are either comparable to or improvement over bounds available in the literature.
Recommendations
Cites work
- scientific article; zbMATH DE number 50805 (Why is no real title available?)
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 1058064 (Why is no real title available?)
- scientific article; zbMATH DE number 777868 (Why is no real title available?)
- A generalized geometric distribution and some of its properties
- Approximation methods in probability theory
- Compound Poisson approximation for nonnegative random variables via Stein's method
- Distribution Theory of Runs: A Markov Chain Approach
- Distributions of numbers of success runs of fixed length in Markov dependent trials
- Distributions related to \((k_{1},k_{2})\) events
- Improved Poisson approximations for word patterns
- Normal Approximation by Stein’s Method
- Normal approximations with Malliavin calculus. From Stein's method to universality
- On Negative Binomial Approximation to k-Runs
- On Stein operators for discrete approximations
- On a modified binomial distribution of order k
- On discrete distributions of order k
- On perturbations of Stein operator
- Poisson approximation for (k1, k2)-events via the Stein-Chen method
- Runs and scans with applications
- Shortest and longest length of success runs in binary sequences
- Stein's method for comparison of univariate distributions
- Successes, runs and longest runs
- Two-parametric compound binomial approximations.
Cited in
(11)- Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns
- On the Combinatorics of Placing Balls into Ordered Bins
- On discrete Gibbs measure approximation to runs
- Compound Poisson approximations to sums of extrema of Bernoulli variables
- On Negative Binomial Approximation to k-Runs
- Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
- A negative binomial approximation to the distribution of the sum of maxima of indicator random variables
- Approximations for sums of three-valued 1-dependent symmetric random variables
- Approximations related to the sums of \(m\)-dependent random variables
- Distributions of \((k_1,k_2,\dots ,k_m)\)-runs with multi-state trials
- Compound Poisson approximation
This page was built for publication: Pseudo-binomial approximation to \((k_1, k_2)\)-runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722650)