Three-Parameter Approximations of Sums of Locally Dependent Random Variables via Stein's Method
Abstract
Let \Xi, i∈ J\ be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum W=Σi∈ JXi and use Stein's method to establish general upper error bounds for the total variation distance dTV(W, M), where M represents a three-parameter random variable. As a direct consequence, we obtain a discretized normal approximation for W. As applications, we study in detail four well-known examples, which are counting vertices of all edges point inward, birthday problem, counting monochromatic edges in uniformly colored graphs, and triangles in the Erdos-R\'enyi random graph. Through delicate analysis and computations, we obtain sharper upper error bounds than existing results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.