Limit theory of combinatorial optimization for random geometric graphs
Limit theory of combinatorial optimization for random geometric graphs
In the random geometric graph G(n,rn), n vertices are placed randomly in Euclidean d-space and edges are added between any pair of vertices distant at most rn from each other. We establish strong laws of large numbers (LLNs) for a large class of graph parameters, evaluated for G(n,rn) in the …