This article continues an investigation begun in [2]. A random graph Gn(x) is constructed on independent random points U1, · ··, Un distributed uniformly on [0, 1]d, d ≧ 1, in which two distinct such points are joined by an edge if the l∞-distance between them is at most some prescribed value 0 < x ...
No comments yet
Be the first to share your thoughts!