zbMATH — the first resource for mathematics

Limit distributions of extremal distances to the nearest neighbor. (English. Russian original) Zbl 1395.60031
Discrete Math. Appl. 28, No. 3, 189-199 (2018); translation from Diskretn. Mat. 29, No. 2, 3-17 (2017).
Summary: Theorems on the limit distributions of the minimal and maximal distances to the nearest neighbor in a sample of random independent points having a uniform distribution on a metric space are proved. As examples of such spaces a multidimensional torus and a binary cube are considered.

60F05 Central limit and other weak theorems
62E20 Asymptotic distribution theory in statistics
Full Text: DOI
[1] Sevast’fyanov B. A., “Poisson limit law for a scheme of sums of dependent random variables”, Theory Probab. Appl., 17:4 (1973), 695-699.
[2] Silverman B., Brown T., “Short distances, flat triangles and Poisson limits”, J. Appl. Probab., 15 (1978), 815-825. · Zbl 0396.60029
[3] Henze N., “The limit distribution for maxima of «weighted» r-th nearest-neighbor distances”, J. Appl. Prob., 19 (1982), 344-354. · Zbl 0484.62034
[4] Penrose M.D., Yukich J. E., “Laws of large numbers and nearest neighbor distances”, Advances in Directional and Linear Statistics, Berlin: Physica-Verlag HD, 2011, 189-199.
[5] Baryshnikov Yu., Penrose M.D., Yukich J. E., “Gaussian limits for generalized spacings”, Ann. Appl. Probab., 19:1 (2009), 158-185. · Zbl 1159.60315
[6] Bickel P. J., Breiman L., “Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test”, Ann. Probab., 11:1 (1983), 185-214. · Zbl 0502.62045
[7] Schilling M. F., “Goodness of fit testing in Rm based on theweighted empirical distribution of certain nearest neighbor statistics”, Ann. Statist., 11:1 (1983), 1-12. · Zbl 0518.62041
[8] Schilling M. F., “An infinite-dimensional approximation for nearest neighbor goodness of fit tests”, Ann. Statist., 11:1 (1983), 13-24. · Zbl 0532.62076
[9] Ľécuyer P., Cordeau J.-F., Simard R., “Close-point spatial tests and their application to random number generators”, Oper. Res., 48:2 (2000), 308-317. · Zbl 1106.65301
[10] Mikhailov V. G., “A central limit theorem for the number of partial long repetitions”, Theory Probab. Appl., 20:4 (1976), 862-866. · Zbl 0352.60017
[11] Mikhailov V. G., “Poisson-type limit theorems for the number of incomplete matches of S-patterns”, Theory Probab. Appl., 47:2 (2003), 343-351. · Zbl 1033.60026
[12] Burden C. J., Kantorovitz M. R., Wilson S. R., “Approximate word matches between two random sequences”, Ann. Appl. Probab., 18:1 (2008), 1-21. · Zbl 1141.60013
[13] Zubkov A. M., Mikhailov V. G., “Limit distributions of random variables associated with long duplications in a sequence of independent trials”, Theory Probab. Appl., 19:1 (1974), 172-179. · Zbl 0326.60024
[14] Karlin S., Ost F., “Counts of long aligned word matches among random letter sequences”, Adv. Appl. Prob., 19:2 (1987), 293-351. · Zbl 0621.60074
[15] Zubkov A. M., Kruglov V. I., “On coincidences of tuples in a binary tree with random labels of vertices”, Discrete Math. Appl., 26:3 (2016), 145-153. · Zbl 1345.05092
[16] Mikhaylov V. G., “Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain”, Discrete Math. Appl., 26:2 (2016), 105-113. · Zbl 1375.60116
[17] Mikhailov V. G., “On the probability of existence of substrings with the same structure in a random sequence”, Discrete Math. Appl., 27:6 (2017), 377-386. · Zbl 1397.60099
[18] Burago Yu. D., Zalgallier V. A., Geometric inequalities, Springer, Berlin - N. Y., 1988.
[19] Riordan J., An Introduction to Combinatorial Analysis, John Wiley & Sons, 1958, 256 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.