On the spectrum of dense random geometric graphs
On the spectrum of dense random geometric graphs
In this paper we study the spectrum of the random geometric graph G(n,r), in a regime where the graph is dense and highly connected. In the Erdős–Rényi G(n,p) random graph it is well known that upon connectivity the spectrum of the normalized graph Laplacian is concentrated around 1. We show …