A central limit theorem for decomposable random variables with applications to random graphs (Q1264157): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(89)90014-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968989096 / rank | |||
Normal rank | |||
Revision as of 17:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A central limit theorem for decomposable random variables with applications to random graphs |
scientific article |
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
