
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both Stein's method for distributional approximation and Stein's method for concentration. As applications, we prove local central limit theorems with rate of convergence for the number of germs with d neighbors in a germ‐grain model, and the number of degree‐d vertices in an Erdős‐Rényi random graph. In both cases, the error rate is optimal, up to logarithmic factors.
Applied Mathematics, General Mathematics, Probability (math.PR), Random graphs (graph-theoretic aspects), Central limit and other weak theorems, local limit theorems, Computer Graphics and Computer-Aided Design, 510, germ-grain models, Erdős-Renyi random graph, FOS: Mathematics, Stein's method, Software, Mathematics - Probability
Applied Mathematics, General Mathematics, Probability (math.PR), Random graphs (graph-theoretic aspects), Central limit and other weak theorems, local limit theorems, Computer Graphics and Computer-Aided Design, 510, germ-grain models, Erdős-Renyi random graph, FOS: Mathematics, Stein's method, Software, Mathematics - Probability
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
