High-Dimensional Random Geometric Graphs and their Clique Number
High-Dimensional Random Geometric Graphs and their Clique Number
We study the behavior of random geometric graphs in high dimensions. We show that as the dimension grows, the graph becomes similar to an Erdös-Rényi random graph. We pay particular attention to the clique number of such graphs and show that it is very close to that of the corresponding …