Random geometric graphs and the spherical Wishart matrix

arXiv2110.10785MaRDI QIDQ6380892FDOQ6380892

Andrew Vander Werf, Elliot Paquette

Publication date: 20 October 2021

Abstract: We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$ by logarithmic factors, this graph is comparable to the ErdH{o}s--R'enyi random graph of the same edge density in the emph{inclusion divergence} between the graph laws. This divergence functions in certain ways like a relaxation of the total variation distance, but is strong enough to distinguish ErdH{o}s--R'enyi graphs of different densities with a higher resolution than the total variation distance. To do the analysis, we derive some exact statistics of the emph{spherical Wishart matrix}, the Gram matrix of $n$ independent uniformly random $d$--dimensional spherical vectors. In particular we give expressions for the characteristic function of the spherical Wishart matrix which are well--approximated using steepest descent.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12)

This page was built for publication: Random geometric graphs and the spherical Wishart matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380892)