Related papers: Bounds on Negative Binomial Approximation to Call …
A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on…
One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…
Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class…
Let F ($\nu$) be the centered Gamma law with parameter $\nu$ > 0 and let us denote by P Y the probability distribution of a random vector Y. We develop a multidimensional variant of the Stein's method for Gamma approximation that allows to…
This letter studies distributed stochastic optimization over a peer-to-peer network when agents can query only zeroth-order function values. We propose ZOOM-PB, a coordinate-sampling distributed zeroth-order method equipped with a…
We study finite-sample inference for the trade-off function of two unknown probability distributions, the function that traces the optimal type I/type II error frontier in binary testing. Given samples from distributions $P$ and $Q$, we…
We present some new and explicit error bounds for the approximation of distributions. The approximation error is quantified by the maximal density ratio of the distribution $Q$ to be approximated and its proxy $P$. This non-symmetric…
We obtain conditional upper bounds for negative discrete moments of the derivative of the Riemann zeta-function averaged over a subfamily of zeros of the zeta function which is expected to have full density inside the set of all zeros. For…
We introduce a new numerical approximation method for functionals of factor credit portfolio models based on the theory of mod-$\phi$ convergence and mod-$\phi$ approximation schemes. The method can be understood as providing correction…
This paper develops Kolmogorov-type maximal inequalities for sums of Negative Binomial random variables under both independence and dependence structures. For independent heterogeneous Negative Binomial variables we derive sharp Markov-type…
We study the accuracy of a scaled Poisson approximation to the weighted sum of independent Poisson random variables, focusing on in particular the relative error of the tail distribution. A bound on the relative approximation error is…
The study of transversal fluctuation of the optimal path has been a crucial aspect of the Kadar-Parisi-Zhang (KPZ) universality class. In this paper, we establish a new probability lower bound, with optimal exponential order, for the rare…
We propose a new method for estimating the minimizer $\boldsymbol{x}^*$ and the minimum value $f^*$ of a smooth and strongly convex regression function $f$ from the observations contaminated by random noise. Our estimator $\boldsymbol{z}_n$…
The computation and inversion of the binomial and negative binomial cumulative distribution functions play a key role in many applications. In this paper, we explain how methods used for the central beta distribution function (described in…
We derive explicit lower and upper bounds for the probability generating functional of a stationary locally stable Gibbs point process, which can be applied to summary statistics like the F function. For pairwise interaction processes we…
Negative binomial regression is commonly employed to analyze overdispersed count data. With small to moderate sample sizes, the maximum likelihood estimator of the dispersion parameter may be subject to a significant bias, that in turn…
We obtain rates of convergence in limit theorems of partial sums $S_n$ for certain sequences of dependent, identically distributed random variables, which arise naturally in statistical mechanics, in particular, in the context of the…
We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds for the error term of a counting formula given by Li and Wan,…
We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…
LLM inference often generates a batch of candidates for a prompt and selects one via strategies like majority voting or Best-of- N (BoN). For difficult tasks, this single-shot selection often underperforms. Consequently, evaluations…