Information and dimensionality of anisotropic random geometric graphs

Abstract

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and independently from a non-isotropic d-dimensional Gaussian distribution, and two vertices are connected if the distance between them is smaller than some pre-specified threshold. We derive new notions of dimensionality which depend upon the eigenvalues of the covariance of the Gaussian distribution. If α denotes the vector of eigenvalues, and n is the number of vertices, then the quantities (‖α‖2‖α‖3)6∕n3 and (‖α‖2‖α‖4)4∕n3 determine upper and lower bounds for the possibility of detection. This generalizes a recent result by Bubeck, Ding, Rácz and the first named author from Bubeck et al. (Random Struct Algoritm 49(3):503–532, 2016) which shows that the quantity d∕n3 determines the boundary of detection for isotropic geometry. Our methods involve Fourier analysis and the theory of characteristic functions to investigate the underlying probabilities of the model. The proof of the lower bound uses information theoretic tools, based on the method presented in Bubeck and Ganguly (Int Math Res Not 2018(2):588–606, 2016).