- Series
- Stochastics Seminar
- Time
- Thursday, January 24, 2013 - 3:05pm for 1 hour (actually 50 minutes)
- Location
- Skyles 006
- Speaker
- Sebastien Bubeck – Princeton University
- Organizer
- Karim Lounici
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.