uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Monotonicity, asymptotic normality and vertex degrees in random graphs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.
2007 (English)In: Bernoulli, ISSN 1350-7265, Vol. 13, no 4, 952-965 p.Article in journal (Refereed) Published
Abstract [en]

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ér-Wold theorem holds. We show that such a version holds under a weak supplementary condition, but not without it.

Place, publisher, year, edition, pages
2007. Vol. 13, no 4, 952-965 p.
Keyword [en]
asymptotic normality, conditional limit theorem, Cramer–Wold theorem, random allocations, random graphs, vertex degrees
National Category
URN: urn:nbn:se:uu:diva-12748DOI: 10.3150/07-BEJ6103ISI: 000251280100004OAI: oai:DiVA.org:uu-12748DiVA: diva2:40517
Available from: 2008-01-11 Created: 2008-01-11 Last updated: 2011-01-14Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Janson, Svante
By organisation
Department of Mathematics
In the same journal

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 138 hits
ReferencesLink to record
Permanent link

Direct link