Loading...
Loading...

Go to the content (press return)

Learning random points from geometric graphs or orderings

Author
Diaz, J.; Mcdiarmid, C.; Mitsche, D.
Type of activity
Report
Date
2018-09-26
Project funding
Graph-based Models and Methods for Computing in the Large
URL
https://arxiv.org/abs/1809.09879 Open in new window
Abstract
Suppose that there is a family of n random points Xv for v¿V, independently and uniformly distributed in the square [-n--v/2,n--v/2]2. We do not see these points, but learn about them in one of the following two ways. Suppose first that we are given the corresponding random geometric graph G, where distinct vertices u and v are adjacent when the Euclidean distance dE(Xu,Xv) is at most r. Assume that the threshold distance r satisfies n3/14«r«n1/2. We shall see that the following holds with hi...
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants