Asymptotic normality of graph statistics (Q1116572)

From MaRDI portal
Revision as of 15:19, 13 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
Asymptotic normality of graph statistics
scientific article

    Statements

    Asymptotic normality of graph statistics (English)
    0 references
    0 references
    1989
    0 references
    Various type of graph statistics for Bernoulli graphs are represented as numerators of incomplete U-statistics. Asymptotic normality of these statistics is proved for Bernoulli graphs in which the edge probability is constant. In addition it is shown that subgraph counts asymptotically are linear functions of the number of edges in the graph.
    0 references
    random graphs
    0 references
    induced subgraph counts
    0 references
    Markov graphs
    0 references
    graph statistics
    0 references
    Bernoulli graphs
    0 references
    numerators of incomplete U-statistics
    0 references
    Asymptotic normality
    0 references

    Identifiers