  We analyse graphs in which each vertex is assigned random coordinates in a
geometric space of arbitrary dimensionality and only edges between adjacent
points are present. The critical connectivity is found numerically by examining
the size of the largest cluster. We derive an analytical expression for the
cluster coefficient which shows that the graphs are distinctly different from
standard random graphs, even for infinite dimensionality. Insights relevant for
graph bi-partitioning are included.
