English: The generative model for an exchangeable random graph defined by a graphon. The graphon is shown as a magenta heatmap. A random graph is generated by assigning each vertex ${\displaystyle k}$ a ${\displaystyle U[0,1]}$ random variable ${\displaystyle u_{k}}$ and including each edge ${\displaystyle (k,l)}$ independently with probability ${\displaystyle W(U_{k},U_{l})}$.

For example, edge ${\displaystyle (3,5)}$ (green, dotted) is present with probability ${\displaystyle W(0.72,0.9)}$; the green boxes in the right square represent the values of ${\displaystyle (u_{3},u_{5})}$ and ${\displaystyle (u_{5},u_{3})}$. The upper left panel shows the graph realization as an adjacency matrix.

This figure was originally made for (and is included in) https://arxiv.org/abs/1512.03099. It is intended for inclusion in graphon