메뉴 건너뛰기
Advances in Applied Probability
Volumn 31, Issue 4, 1999, Pages 969-984
The central limit theorem for euclidean minimal spanning trees II
Author keywords

Central limit theorem; Continuum percolation; Minimal spanningtree
Indexed keywords

EID: 0033315088     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1029955253     Document Type: Article
Times cited : (26)
References (14)
  • 1
    • 0043047050 scopus 로고
    • Rates of convergence of means for distance-minimizing subadditive Euclidean functionals
    • Alexander, K. S. (1994). Rates of convergence of means for distance-minimizing subadditive Euclidean functionals. Ann. Appl Prob. 4, 902-922.
    • (1994) Ann. Appl Prob. , vol.4 , pp. 902-922
    • Alexander, K.S.1
  • 2
    • 21844510142 scopus 로고
    • Simultaneous uniqueness of infinite clusters in stationary random labeled graphs
    • Alexander, K. S. (1995). Simultaneous uniqueness of infinite clusters in stationary random labeled graphs. Commun. Math. Phys. 168, 39-55.
    • (1995) Commun. Math. Phys. , vol.168 , pp. 39-55
    • Alexander, K.S.1
  • 3
    • 0000673504 scopus 로고
    • Multivariate generalizations of the Wolfowitz and Smirnov two-sample tests
    • Friedman, J. H. and Rafsky, L. C. (1979). Multivariate generalizations of the Wolfowitz and Smirnov two-sample tests. Ann. Statist. 7, 697-717.
    • (1979) Ann. Statist. , vol.7 , pp. 697-717
    • Friedman, J.H.1    Rafsky, L.C.2
  • 4
    • 0000930629 scopus 로고
    • Graph-theoretic measures of multivariate association and prediction
    • Friedman, J. H. and Rafsky, L. C. (1983). Graph-theoretic measures of multivariate association and prediction. Ann. Statist. 11, 377-391.
    • (1983) Ann. Statist. , vol.11 , pp. 377-391
    • Friedman, J.H.1    Rafsky, L.C.2
  • 6
    • 0011504568 scopus 로고
    • Rate of convergence for the Euclidean minimum spanning tree law
    • Jaillet, P. (1993). Rate of convergence for the Euclidean minimum spanning tree law. Operat. Res. Lett. 14, 73-78.
    • (1993) Operat. Res. Lett. , vol.14 , pp. 73-78
    • Jaillet, P.1
  • 7
    • 0030501338 scopus 로고    scopus 로고
    • The central limit theorem for weighted minimal spanning trees on random point
    • Kesten, H. and Lee, S. (1996). The central limit theorem for weighted minimal spanning trees on random point. Ann. Appl. Prob. 6, 495-527.
    • (1996) Ann. Appl. Prob. , vol.6 , pp. 495-527
    • Kesten, H.1    Lee, S.2
  • 8
    • 0031260688 scopus 로고    scopus 로고
    • The central limit theorem for Euclidean minimal spanning trees I
    • Lee, S. (1997). The central limit theorem for Euclidean minimal spanning trees I. Ann. Appl. Prob. 7, 996-1020.
    • (1997) Ann. Appl. Prob. , vol.7 , pp. 996-1020
    • Lee, S.1
  • 10
    • 0000964674 scopus 로고
    • Dependent central limit theorems and invariance principles
    • McLeish, D. L. (1974). Dependent central limit theorems and invariance principles. Ann. Prob. 2, 620-628.
    • (1974) Ann. Prob. , vol.2 , pp. 620-628
    • McLeish, D.L.1
  • 11
    • 84911584312 scopus 로고
    • Shortest connecting networks and some generalizations
    • Prim, R. C. (1957). Shortest connecting networks and some generalizations. Bell Syst. Tech. J. 36, 1389-1401.
    • (1957) Bell Syst. Tech. J. , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 12
    • 0016699095 scopus 로고
    • Generalization of the gap test for the detection of multivariate outliers
    • Rohlf, F. J. (1975). Generalization of the gap test for the detection of multivariate outliers. Biometrics 31, 93-101.
    • (1975) Biometrics , vol.31 , pp. 93-101
    • Rohlf, F.J.1
  • 13
    • 0000729159 scopus 로고
    • Growth rates of Euclidean minimal spanning trees with power weighted edges
    • Steele, J. M. (1988). Growth rates of Euclidean minimal spanning trees with power weighted edges. Ann. Prob. 16, 1767-1787.
    • (1988) Ann. Prob. , vol.16 , pp. 1767-1787
    • Steele, J.M.1
  • 14
    • 0000907076 scopus 로고
    • On the number of leaves of a Euclidean minimal spanning tree
    • Steele, J. M., Shepp, L. A. and Eddy, W. F. (1987). On the number of leaves of a Euclidean minimal spanning tree. J. Appl. Prob. 24, 809-826.
    • (1987) J. Appl. Prob. , vol.24 , pp. 809-826
    • Steele, J.M.1    Shepp, L.A.2    Eddy, W.F.3

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.