20 June 1995 Graphs on uniform points in [0,1]d
Author Affiliations +
Abstract
Statistical problems in pattern or structure recognition for a random multidimensional point set may be addressed by variations on the random graph model of Erdos and Renyui. The imposition of graph structure with a variable edge criterion on a large random point set allows a search for signature quantities or behavior under the given distributional hypothesis. The work is motivated by the question of how to make statistical inferences from sensed mine field data. This article describes recent results obtained in the following special cases. On independent random points U1,...,Un distributed uniformly on [0,1]d, a random graph Gn(x) is constructed in which two distinct such points are joined by an edge if the l(infinity )-distance between them is at most some prescribed value 0 n, the smallest x such that Gn(x) is connected, and the largest nearest neighbor link dn, the smallest x such that Gn(x) has no vertices of degree zero, are asymptotic in ratio, as n becomes large, for d >= 2.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Martin J. B. Appel, Martin J. B. Appel, Ralph P. Russo, Ralph P. Russo, King Jang Yang, King Jang Yang, } "Graphs on uniform points in [0,1]d", Proc. SPIE 2496, Detection Technologies for Mines and Minelike Targets, (20 June 1995); doi: 10.1117/12.211354; https://doi.org/10.1117/12.211354
PROCEEDINGS
11 PAGES


SHARE
Back to Top