-
1
-
-
84990630742
-
A random tree model associated with random graphs
-
ALDOUS, D. (1990). A Random tree model associated with random graphs. Random Structures Algorithms 1 383-401.
-
(1990)
Random Structures Algorithms
, vol.1
, pp. 383-401
-
-
Aldous, D.1
-
2
-
-
0001455013
-
Asymptotics for Euclidean minimal spanning trees on random points
-
ALDOUS, D. and STEELE, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Related Fields 92 247-258.
-
(1992)
Probab. Theory Related Fields
, vol.92
, pp. 247-258
-
-
Aldous, D.1
Steele, J.M.2
-
3
-
-
0001912663
-
Two-sample test statistics for measuring discrepancies between two multivariate probability density functions using kernel-based density estimates
-
ANDERSON, N. H., HALL, P. and TITTERINGTON, D. M. (1994). Two-sample test statistics for measuring discrepancies between two multivariate probability density functions using kernel-based density estimates. J. Multivariate Anal. 50 41-54.
-
(1994)
J. Multivariate Anal.
, vol.50
, pp. 41-54
-
-
Anderson, N.H.1
Hall, P.2
Titterington, D.M.3
-
5
-
-
0039658940
-
Sampling from a graph
-
Math. Centrum, Amsterdam
-
BLOEMENA, A. R. (1964). Sampling from a graph. Mathematical Centre Tracts 2. Math. Centrum, Amsterdam.
-
(1964)
Mathematical Centre Tracts
, vol.2
-
-
Bloemena, A.R.1
-
8
-
-
0000673504
-
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
-
11
-
-
51249180050
-
f-dissimilarity. A generalization of affinity of several distributions
-
GYÖRFI, L. and NEMETZ, T. (1978). f-dissimilarity. A generalization of affinity of several distributions. Ann. Inst. Statist. Math. 30 105-113.
-
(1978)
Ann. Inst. Statist. Math.
, vol.30
, pp. 105-113
-
-
Györfi, L.1
Nemetz, T.2
-
12
-
-
0009146725
-
On the probability that a random point is the jth nearest neighbour to its own kth nearest neighbour
-
HENZE, N. (1986). On the probability that a random point is the jth nearest neighbour to its own kth nearest neighbour. J. Appl. Probab. 23 221-226.
-
(1986)
J. Appl. Probab.
, vol.23
, pp. 221-226
-
-
Henze, N.1
-
13
-
-
0000959190
-
A multivariate two-sample test based on the number of nearest-neighbor type coincidences
-
HENZE, N. (1988). A multivariate two-sample test based on the number of nearest-neighbor type coincidences. Ann. Statist. 16 772-783.
-
(1988)
Ann. Statist.
, vol.16
, pp. 772-783
-
-
Henze, N.1
-
14
-
-
0009219710
-
Almost sure convergence of certain slowly changing symmetric one- and multi-sample statistics
-
HENZE, N. and VOIGT, B. (1992). Almost sure convergence of certain slowly changing symmetric one- and multi-sample statistics. Ann. Probab. 20 1086-1098.
-
(1992)
Ann. Probab.
, vol.20
, pp. 1086-1098
-
-
Henze, N.1
Voigt, B.2
-
16
-
-
0031260688
-
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. Probab. 7 996-1020.
-
(1997)
Ann. Appl. Probab.
, vol.7
, pp. 996-1020
-
-
Lee, S.1
-
17
-
-
0030353886
-
The random minimal spanning tree in high dimensions
-
PENROSE, M. D. (1996). The random minimal spanning tree in high dimensions. Ann. Probab. 24 1903-1925.
-
(1996)
Ann. Probab.
, vol.24
, pp. 1903-1925
-
-
Penrose, M.D.1
-
18
-
-
0020145450
-
Isolated nearest neighbours
-
PICKARD, D. K. (1982). Isolated nearest neighbours. J. Appl. Probab. 19 444-449.
-
(1982)
J. Appl. Probab.
, vol.19
, pp. 444-449
-
-
Pickard, D.K.1
-
21
-
-
0000474812
-
Multivariate two-sample tests based on nearest neighbors
-
SCHILLING, M. F. (1986). Multivariate two-sample tests based on nearest neighbors. J. Amer. Statist. Assoc. 81 799-806.
-
(1986)
J. Amer. Statist. Assoc.
, vol.81
, pp. 799-806
-
-
Schilling, M.F.1
-
22
-
-
0000907076
-
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
|