Random Geometric Graphs

Preprint
Publisher Website
Google Scholar
  • 1 March 2002
Abstract
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. Insights relevant for graph bi-partitioning are included. Comparisons with results on random graphs are made.

This publication has 0 references indexed in Scilit: