Let be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum and use Stein’s method to establish general upper error bounds for the total variation distance , where represents a three-parameter random variable. As a direct consequence, we obtain a discretized normal approximation for . 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 Erdős-Rényi random graph. Through delicate analysis and computations, we obtain sharper upper error bounds than existing results.

生成讲解博客的中文版本

生成AI智能校验的中文版本