Clique Number of Random Geometric Graphs in High Dimension

Stochastics Seminar
Thursday, January 24, 2013 - 15:05
1 hour (actually 50 minutes)
Skyles 006
Princeton University
In small dimension a random geometric graph behaves very differently from a standard Erdös-Rényi random graph. On the other hand when the dimension tends to infinity (with the number of vertices being fixed) both models coincides. In this talk we study the behavior of the clique number of random geometric graphs when the dimension grows with the number of vertices.