The Random Geometric (RG) graph is created from initially choosing points randomly from [0,1]^d. Next, these points (nodes) are connected by edges with weight inversely proportionate to the Euclidean distance between them. This creates by definition a complete graph where points that are near to each other in R^d are given higher edge weights.
Code
Kahle 2009
Code
Kahle 2009
Local Graph
Measures |
Mesoscale Topological
Features |
Global Network
Properties |