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 \(\left (\frac {\left \lVert \alpha \right \rVert _2}{\left \lVert \alpha \right \rVert _3}\right )^6/n^3\) and \(\left (\frac {\left \lVert \alpha \right \rVert _2}{\left \lVert \alpha \right \rVert _4}\right )^4/n^3\) 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∕n 3 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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
V. Bentkus, A lyapunov-type bound in R d. Theory Probab. Its Appl. 49(2), 311–323 (2005)
S. Bubeck, S. Ganguly, Entropic CLT and phase transition in high-dimensional Wishart matrices. Int. Math. Res. Not. 2018(2), 588–606 (2016)
S. Bubeck, J. Ding, R. Eldan, M.Z. Rácz, Testing for high-dimensional geometry in random graphs. Random Struct. Algoritm. 49(3), 503–532 (2016)
T.M. Cover, J.A. Thomas, Elements of Information Theory (John Wiley & Sons, Hoboken, 2012)
J. Duchi, Derivations for Linear Algebra and Optimization (Berkeley, 2007). http://www.cs.berkeley.edu/~jduchi/projects/generalnotes.pdf
R. Durrett, Probability: Theory and Examples (Cambridge University Press, Cambridge, 2010)
M.L. Eaton, Chapter 8: The wishart distribution, in Multivariate Statistics, Lecture Notes–Monograph Series, vol. 53 (Institute of Mathematical Statistics, Beachwood, 2007), pp. 302–333
P. Erdős, A. Rényi, On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci 5, 17–61 (1960)
L. Hörmander, The Analysis of Linear Partial Differential Operators I: Distribution Theory and Fourier Analysis (Springer, Berlin, 2015)
R. Latala, P. Mankiewicz, K. Oleszkiewicz, N. Tomczak-Jaegermann, Banach-Mazur distances and projections on random subgaussian polytopes. Discret. Comput. Geom. 38(1), 29–50 (2007)
I. Nourdin, G. Peccati, Normal Approximations with Malliavin Calculus: from Stein’s Method to Universality, vol. 192 (Cambridge University Press, Cambridge, 2012)
V.V. Petrov, Limit Theorems of Probability Theory (Oxford University Press, Oxford, 1995)
N.G. Shephard, From characteristic function to distribution function: a simple framework for the theory. Economet. Theor. 7(4), 519–529 (1991)
T. Tao, Topics in Random Matrix Theory, vol. 132 (American Mathematical Society, Providence, 2012)
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, in Compressed Sensing (Cambridge University Press, Cambridge, 2012), pp. 210–268
Acknowledgements
We would like to thank the anonymous referee for carefully reading this paper and for the thoughtful comments which helped improve the overall presentation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Eldan, R., Mikulincer, D. (2020). Information and Dimensionality of Anisotropic Random Geometric Graphs. In: Klartag, B., Milman, E. (eds) Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol 2256. Springer, Cham. https://doi.org/10.1007/978-3-030-36020-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-36020-7_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36019-1
Online ISBN: 978-3-030-36020-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)