Share Email Print
cover

Proceedings Paper

Graphs on uniform points in [0,1]d
Author(s): Martin J. B. Appel; Ralph P. Russo; King Jang Yang
Format Member Price Non-Member Price
PDF $14.40 $18.00

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

Paper Details

Date Published: 20 June 1995
PDF: 11 pages
Proc. SPIE 2496, Detection Technologies for Mines and Minelike Targets, (20 June 1995); doi: 10.1117/12.211354
Show Author Affiliations
Martin J. B. Appel, Univ. of Iowa (United States)
Ralph P. Russo, Univ. of Iowa (United States)
King Jang Yang, Univ. of Iowa (United States)


Published in SPIE Proceedings Vol. 2496:
Detection Technologies for Mines and Minelike Targets
Abinash C. Dubey; Ivan Cindrich; James M. Ralston; Kelly A. Rigano, Editor(s)

© SPIE. Terms of Use
Back to Top