Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T02:44:54.770Z Has data issue: false hasContentIssue false
  • English
  • Français

Limit laws for the diameter of a random point set

Part of:Geometric probability and stochastic geometryLimit theorems

Published online by Cambridge University Press:  19 February 2016

Martin J. B. Appel,
Christopher A. Najim and
Ralph P. Russo
Martin J. B. Appel*
Affiliation:
MGIC
Christopher A. Najim*
Affiliation:
University of Iowa
Ralph P. Russo*
Affiliation:
University of Iowa
*
∗ Postal address: Capital Markets Operations, MGIC, 270 E. Kilbourn Ave, Milwaukee, WI 53202, USA.
∗∗ Postal address: Department of Statistics and Actuarial Science, University of Iowa, Iowa City, IA 52242, USA.
∗∗ Postal address: Department of Statistics and Actuarial Science, University of Iowa, Iowa City, IA 52242, USA.
Get accessRights & Permissions [Opens in a new window]

Abstract

Let U 1,U 2,… be a sequence of i.i.d. random vectors distributed uniformly in a compact plane region A of unit area. Sufficient conditions on the geometry of A are provided under which the Euclidean diameter D n of the first n of the points converges weakly upon suitable rescaling.

Keywords

Maximum distancediameterextreme value distributiongeometric probability

MSC classification

Primary:60F05: Central limit and other weak theorems
Secondary:60D05: Geometric probability and stochastic geometry

Information

Type
Stochastic Geometry and Statistical Applications
Information
Advances in Applied Probability , Volume 34 , Issue 1 , March 2002, pp. 1 - 10
Copyright
Copyright © Applied Probability Trust 2002 

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.)

Article purchase

Temporarily unavailable

References

Appel, M. J. B. and Russo, R. P. (1997). The maximum vertex degree of a graph on uniform points in [0,1]d . Adv. Appl. Prob. 29, 567–581.CrossRefGoogle Scholar
Appel, M. J. B. and Russo, R. P. (1997). The minimum vertex degree of a graph on uniform points in [0,1]d . Adv. Appl. Prob. 29, 582–594.CrossRefGoogle Scholar
Appel, M. J. B., Klass, M. and Russo, R. P. (1999). Series criteria for the maximum of a symmetric function on a random point set. J. Theor. Prob. 12, 27–47.CrossRefGoogle Scholar
Appel, M. J. B., Najim, C. A. and Russo, R. P. (2000). Random diameters. Tech. Rep. 308, University of Iowa.Google Scholar
Dudley, R. M. (1978). Central limit theorems for empirical measures. Ann. Prob. 6, 899–929.CrossRefGoogle Scholar
Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. 2, 2nd edn. John Wiley, New York.Google Scholar
Henze, N. and Klein, T. (1996). The limit distribution of the largest interpoint distance from a symmetric Kotz sample. J. Multivariate Anal. 57, 229–239.CrossRefGoogle Scholar
Matthews, P. C. and Rukhin, A. L. (1993). Asymptotic distribution of the normal sample range. Ann. Appl. Prob. 3, 454–466.CrossRefGoogle Scholar