2000 character limit reached
A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph (1005.4390v4)
Published 24 May 2010 in math.PR
Abstract: Applying Stein's method, an inductive technique and size bias coupling yields a Berry-Esseen theorem for normal approximation without the usual restriction that the coupling be bounded. The theorem is applied to counting the number of vertices in the Erdos-Renyi random graph of a given degree.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.