Clique Number of Random Geometric Graphs in High Dimension
Series:
Computer Science/Discrete Mathematics
Sebastien Bubeck
Princeton University
Date & Time:
Mon, 01/21/2013 - 11:15 - 12:15
Location:
S-101 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 coincide. In this talk we study the behavior of the clique number of random geometric graphs when the dimension grows with the number of vertices.
45064
Dorothea Phares
phares@ias.edu
Fri, 10/12/2012 - 17:31
Thu, 01/03/2013 - 15:31