The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Asymptotic normality of graph statistics

Author

Summary, in English

Various types 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.

Publishing year

1989

Language

English

Pages

209-222

Publication/Series

Journal of Statistical Planning and Inference

Volume

21

Issue

2

Document type

Journal article

Publisher

North-Holland

Topic

  • Probability Theory and Statistics

Keywords

  • Markov graphs
  • incomplete U-statistics
  • U-statistics
  • induced subgraph counts
  • Random graphs
  • subgraph counts

Status

Published

ISBN/ISSN/Other

  • ISSN: 1873-1171