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.
Department/s
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