A central limit theorem for decomposable random variables with applications to random graphs (Q1264157)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A central limit theorem for decomposable random variables with applications to random graphs |
scientific article; zbMATH DE number 4128850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A central limit theorem for decomposable random variables with applications to random graphs |
scientific article; zbMATH DE number 4128850 |
Statements
A central limit theorem for decomposable random variables with applications to random graphs (English)
0 references
1989
0 references
Stein's method of proving the central limit theorem for dependent random variables is applied in the context of random graph theory. Results are given for various subgraph counts and degree counts in Bernoulli graphs.
0 references
normal approximation
0 references
rate of convergence
0 references
decomposable random variables
0 references
subgraph counts
0 references
degree counts
0 references
Bernoulli graphs
0 references
0.93732774
0 references
0.92589366
0 references
0.91896003
0 references
0.9122129
0 references
0.9100291
0 references
0.9079116
0 references
0.9053986
0 references
