A central limit theorem for decomposable random variables with applications to random graphs (Q1264157)

From MaRDI portal
Revision as of 18:41, 17 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers