Title: Symmetry of random graphs
|Affiliation:||University of Waterloo|
|Zoom:||Please email Emma Watson|
A graph is said asymmetric if its automorphism group contains only the identity permutation. Otherwise, it is said symmetric. In this talk we will survey symmetry of Erdos-Renyi random graphs, of random regular graphs, and of random graphs with moderate degree sequences. We present some new results which characterise the phase transition of symmetry of random graphs with bounded degrees. This work is collaborated with Lochlan Brick and Angus Southwell.