I am studying the cut metric from Large Networks and Graph Limits by Lovasz and need help proving one of the statements.
On page 128, it says that the cut distance between two independent random graphs on $[n]$ with edge probability $\frac{1}{2}$ is $O(\frac{1}{\sqrt{n}})$, with high probability. Could someone please help me prove this statement in details? Thanks!