2023
DOI: 10.1002/rsa.21178
|View full text |Cite
|
Sign up to set email alerts
|

Threshold for detecting high dimensional geometry in anisotropic random geometric graphs

Abstract: In the anisotropic random geometric graph model, vertices correspond to points drawn from a high‐dimensional Gaussian distribution and two vertices are connected if their distance is smaller than a specified threshold. We study when it is possible to hypothesis test between such a graph and an Erdős‐Rényi graph with the same edge probability. If is the number of vertices and is the vector of eigenvalues, Eldan and Mikulincer, Geo. Aspects Func. Analysis: Israel seminar, 2017 shows that detection is possible … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 15 publications
0
0
0
Order By: Relevance