Pseudo-binomial approximation to (k₁, k₂)-runs

DOI10.1016/J.SPL.2018.05.016zbMATH Open1395.62028arXiv1609.07847OpenAlexW2527531900MaRDI QIDQ722650FDOQ722650

Authors: N. S. Upadhye, Amit N. Kumar 

Publication date: 27 July 2018

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: ($k_1,k_2$)-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.

Full work available at URL: https://arxiv.org/abs/1609.07847

Recommendations

• On Negative Binomial Approximation to k-Runs
• Exact and approximate runs distributions
• Poisson approximations for runs and patterns of rare events
• Approximating the distributions of runs and patterns
• Approximation for counts of head runs

zbMATH Keywords

Stein's methodcoupling\((k_1, k_2)\)-runsPseudo-binomial distributionStein operator

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Approximations to statistical distributions (nonasymptotic) (62E17)

Cites Work

• Normal Approximation by Stein’s Method
• A generalized geometric distribution and some of its properties
• Runs and scans with applications
• Normal approximations with Malliavin calculus. From Stein's method to universality
• Title not available (Why is that?)
• Distribution Theory of Runs: A Markov Chain Approach
• On discrete distributions of order k
• Title not available (Why is that?)
• Approximation methods in probability theory
• Compound Poisson approximation for nonnegative random variables via Stein's method
• On Negative Binomial Approximation to k-Runs
• Two-parametric compound binomial approximations.
• Shortest and longest length of success runs in binary sequences
• Improved Poisson approximations for word patterns
• Distributions related to \((k_{1},k_{2})\) events
• Title not available (Why is that?)
• Successes, runs and longest runs
• Distributions of numbers of success runs of fixed length in Markov dependent trials
• Stein's method for comparison of univariate distributions
• Poisson approximation for (k₁, k₂)-events via the Stein-Chen method
• On Stein operators for discrete approximations
• Title not available (Why is that?)
• On perturbations of Stein operator
• On a modified binomial distribution of order k

Cited In (11)

• Approximations for sums of three-valued 1-dependent symmetric random variables
• Compound Poisson approximation
• On the Combinatorics of Placing Balls into Ordered Bins
• Distributions of \((k_1,k_2,\dots ,k_m)\)-runs with multi-state trials
• On Negative Binomial Approximation to k-Runs
• Compound Poisson approximations to sums of extrema of Bernoulli variables
• Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns
• On discrete Gibbs measure approximation to runs
• Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern
• Approximations related to the sums of \(m\)-dependent random variables
• A negative binomial approximation to the distribution of the sum of maxima of indicator random variables

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)