Monotonicity, asymptotic normality and vertex degrees in random graphs

Details Monotonicity, asymptotic normality and vertex degrees in random graphs Monotonicity, asymptotic normality and vertex degrees in random graphs

2006-05-24

arxiv.org/abs/math/0605642v2

Bernoulli 2007, Vol. 13, No. 4, 952-965

Mathematics

Probability

Published in at http://dx.doi.org/10.3150/07-BEJ6103 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statist

Scientific paper

10.3150/07-BEJ6103

We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality for the number of vertices with a given degree in the random graph ${G(n,m)}$ with a fixed number of edges from the corresponding result for the random graph ${G(n,p)}$ with independent edges. We also give some simple applications to random allocations and to spacings. Finally, inspired by these results, but logically independent of them, we investigate whether a one-sided version of the Cram\'{e}r--Wold theorem holds. We show that such a version holds under a weak supplementary condition, but not without it.

Affiliated with

Also associated with

No associations

Rating

Monotonicity, asymptotic normality and vertex degrees in random graphs 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 Monotonicity, asymptotic normality and vertex degrees in random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monotonicity, asymptotic normality and vertex degrees in random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-71733