Summary
We consider the random variable
where {X i } =1/n i and {Y ij }1≦i<i≦n are two independent sequences of i.i.d. random variables. This paper gives a general treatment of the asymptotic behaviour of sums of the formS n, v (f). We use a projection method and expandf into a (finite) sum of terms of increasing complexity. The terms in such an expansion are indexed by graphs and the asymptotic behaviour ofS n, v depends only on the non-zero terms indexed by the smallest graphs. Moreover, the type of the limit distribution depends on the topology of the graphs. In particular,S n, v (f) is asymptotically normally distributed if these graphs are connected, but not otherwise. The general theorems are applied to the problems of finding the asymptotic distribution of the number of copies or induced copies of a given graph in various random graph models.
Article PDF
Similar content being viewed by others
References
Barbour, A., Karoński, M., Ruciński, A.: A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory, Ser. B47, 125–145 (1989)
Blom, G.: Some properties of incomplete U-statistics. Biometrika63, 573–580 (1976)
Hoeffding, W.: On a class of statistics with asymptotically normal distribution. Ann. Math. Stat.19, 293–325 (1948a)
Hoeffding, W.: A non-parametric test of independence. Ann. Math. Stat.19, 546–557 (1948b)
Janson, S.: The asymptotic distributions of incomplete U-statistics. Z. Wahrscheinlichkeitstheor. Verw. Geb.66, 495–505 (1984)
Janson, S., Kratochvil, J.: Proportional graphs. Rand. Struct. Algo.2, 209–224 (1991)
Janson, S., Wichura, M.: Invariance principles for stochastic area and related stochastic integrals. Stochastic Processes16, 71–84 (1983)
Maehara, H.: On the number of induced subgraphs of a random graph. Discrete Math.64, 309–312 (1987)
Nowicki, K.: Asymptotic normality of graphs statistics. J. Statist. Plann. Inference21, 209–222 (1989a)
Nowicki, K.: Asymptotic normality of triad counts in random digraphs. Stochastic Models5, 163–180 (1989b)
Nowicki, K.: Asymptotic distributions of subgraph counts in colored Bernoulli graphs. In: Karoński, M., Ruciński, A., Jaworski J. (eds) Random graphs '87, pp. 203–221. New York: Wiley 1990
Nowicki, K., Wierman, J.C.: Subgraph counts in random graphs using incomplete U-statistics methods. Discrete Math.72, 299–310 (1988)
Rubin, H., Vitale, R.A.: Asymptotic distribution of symmetric statistics. Ann. Stat.170, 165–170 (1980)
Rueiński, A.: When are small subgraphs of a random graph normally distributed? Probab. Theory Relat Fields78, 1–10 (1988)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Janson, S., Nowicki, K. The asymptotic distributions of generalized U-statistics with applications to random graphs. Probab. Th. Rel. Fields 90, 341–375 (1991). https://doi.org/10.1007/BF01193750
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01193750