F. Udina

Learn More
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˝ os-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 Erd˝ os-Rényi graph when the dimension is larger than log 3 n where n(More)
  • 1