A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph

Details A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph

2010-05-24

arxiv.org/abs/1005.4390v3

Mathematics

Probability

Simplification of the application of Theorem 1.1 by judicious choice of $J_n$, index $L_n$ allowed to take value zero, simplif

Scientific paper

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 Erd\H{o}s-R\'enyi random graph of a given degree.

Affiliated with

Also associated with

No associations

Rating

A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119588