weighted sampled graphs converge to the graphon in probability

Let $\{G_n\}$ be a sequence of weighted graphs sampled from graphon $W$. With probability at least $1-\exp (-\frac{n}{2\log n})$,

Where ${\delta }_{◻}$ is the cut metric. ie, $G_n\to W$ in probability.