Subgraph counts in random graphs using incomplete u-statistics methods
- 31 December 1988
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 72 (1-3) , 299-310
- https://doi.org/10.1016/0012-365x(88)90220-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Threshold functions for small subgraphsMathematical Proceedings of the Cambridge Philosophical Society, 1981
- Asymptotic Normality of Permutation Statistics Derived from Weighted Sums of Bivariate FunctionsThe Annals of Statistics, 1979
- Reduced $U$-Statistics and the Hodges-Lehmann EstimatorThe Annals of Statistics, 1978
- The Berry-Esseen Theorem for $U$-StatisticsThe Annals of Statistics, 1978
- On the Berry-Esseen Theorem for $U$-StatisticsThe Annals of Probability, 1977
- Edgeworth Expansions in Nonparametric StatisticsThe Annals of Statistics, 1974
- Convergence Rates for $U$-Statistics and Related StatisticsThe Annals of Statistics, 1973
- Limiting Behavior of Posterior Distributions when the Model is IncorrectThe Annals of Mathematical Statistics, 1966
- A Class of Statistics with Asymptotically Normal DistributionThe Annals of Mathematical Statistics, 1948