Speaker: Yinon Spinka (UBC)


Title: Random graphs on the circle

Abstract: It has long been known that two independent copies of the infinite Erdos-Renyi graph G(\infty,p) are almost surely isomorphic. The resulting graph is called the Rado graph. If the vertices are in a metric space and only nearby vertices may be connected, a similar result may or may not hold, depending on fine details of the underlying metric space. We present new results in the case where the metric space is a circle.

Joint with Omer Angel.