Full text not available from this repository.
The application of Stein's method of obtaining rates of convergence to the normal distribution is illustrated in the context of random graph theory. Problems which exhibit a dissociated structure and problems which do not are considered. Results are obtained for the number of copies of a given graph G in K(n, p), for the number of induced copies of G, for the number of isolated trees of order k ≥ 2, for the number of vertices of degree d ≥ 1, and for the number of isolated vertices.
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Deposited On:||13 Apr 2010 12:38|
|Last Modified:||27 Nov 2013 22:20|
|Free access at:||Related URL. An embargo period may apply.|
|Related URLs:||http://user.math.uzh.ch/barbour/pub/Barbour/BJansonKaronskiRucinski.pdf (Author)|
|Citations:||Web of Science®. Times Cited: 38|
Scopus®. Citation Count: 28
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page