Threshold for detecting high dimensional geometry in anisotropic random geometric graphs
DOI10.1002/rsa.21178zbMath1529.05139arXiv2206.14896MaRDI QIDQ6185052
Brice Huang, Guy Bresler, Matthew Brennan
Publication date: 5 January 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.14896
Hypothesis testing in multivariate analysis (62H15) Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Random matrices (algebraic aspects) (15B52) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- High-dimensional random geometric graphs and their clique number
- Approximation of rectangular beta-Laguerre ensembles and large deviations
- A smooth transition from Wishart to GOE
- Asymptotic behavior of large Gaussian correlated Wishart matrices
- Phase transitions for detecting latent geometry in random graphs
- The middle-scale asymptotics of Wishart matrices
- Testing for high-dimensional geometry in random graphs
- Random Geometric Graphs
- Entropic CLT and Phase Transition in High-dimensional Wishart Matrices
- A CLT in Stein’s Distance for Generalized Wishart Matrices and Higher-Order Tensors
- Information and Dimensionality of Anisotropic Random Geometric Graphs
- Analysis of Boolean Functions
- Testing thresholds for high-dimensional sparse random geometric graphs
This page was built for publication: Threshold for detecting high dimensional geometry in anisotropic random geometric graphs
