Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-05T04:25:18.412Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotic normality of some Graph-Related statistics

Published online by Cambridge University Press:  14 July 2016

Pierre Baldi  and
Yosef Rinott
Pierre Baldi*
Affiliation:
University of California, San Diego
Yosef Rinott*
Affiliation:
Hebrew University
*
∗Postal address: Department of Mathematics, University of California, San Diego, La Jolla, CA 92093, USA.
∗∗Postal address: Department of Statistics, Hebrew University, Jerusalem.
Get access Rights & Permissions [Opens in a new window]

Abstract

Petrovskaya and Leontovich (1982) proved a central limit theorem for sums of dependent random variables indexed by a graph. We apply this theorem to obtain asymptotic normality for the number of local maxima of a random function on certain graphs and for the number of edges having the same color at both endpoints in randomly colored graphs. We briefly motivate these problems, and conclude with a simple proof of the asymptotic normality of certain U-statistics.

Keywords

CENTRAL LIMIT THEOREMDEPENDENT VARIABLESMAXIMA OF RANDOM FUNCTIONSRANDOM COLORINGSU-STATISTICSNEURAL NETWORKS
Type
Short Communications
Information
Journal of Applied Probability , Volume 26 , Issue 1 , March 1989 , pp. 171 - 175
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Work done while visiting the Department of Mathematics at UCSD.

References

Abramson, I and Goldstein, L. (1987) Efficient nonparametric testing by functional estimation. Submitted for publication.Google Scholar
Baldi, P. (1988) Neural networks, orientations of the hypercube and algebraic threshold functions. IEEE Trans. Information Theory 34(3).Google Scholar
Derrida, B. (1980) Random energy model; limit of a family of disordered models. Phys. Rev. Letters 45, 79–82.Google Scholar
Derrida, B. (1981) Random energy model: an exactly solvable model of disordered systems. Phys. Rev. B24, 2613–2626.Google Scholar
Friedman, J. H. and Rafsky, L. C. (1979) Multivariate generalizations of the Wald–Wolfowitz and Smirnov two-sample tests. Ann. Statist. 7, 697–717.Google Scholar
Gross, D. J. and Mezard, M. (1984) The simplest spin glass. Nuclear Phys. B240 [FS12], 431–452.Google Scholar
Henze, N. (1988) A multivariate two-sample test based on the number of nearest neighbor type coincidences, Ann. Statist. 16, 772–783.Google Scholar
Hoeffding, W. (1948) A class of statistics with asymptotically normal distribution. Ann. Math. Statist. 18, 293–325.CrossRefGoogle Scholar
Janson, S. (1986) Birthday problems, randomly coloured graphs and Poisson limits of sums of dissociated variables. Uppsala University Department of Mathematics, Report 16.Google Scholar
Janson, S. (1988) Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs. Ann. Prob. Google Scholar
Petrovskaya, M. B. and Leontovich, A. M. (1982) The central limit theorem for a sequence of random variables with a slowly growing number of dependencies. Theory Prob. Appl. 27, 815–825.Google Scholar
Powers, I. Y. (1986) Three Essays on Game Theory. Ph. D. Dissertation, Yale University.Google Scholar
Schilling, M. F. (1986) Multivariate two-sample tests based on nearest neighbors. J. Amer. Statist. Assoc. 81, 799–806.Google Scholar
Serfling, R. J. (1980) Approximation Theorems of Mathematical Statistics. Wiley, New York.Google Scholar
Tovey, C. (1985) Hill climbing with multiple local optima. SIAM J. Algebraic and Discrete Methods 6, 386–393.Google Scholar