fully random graph

Fully random graphs are a way to sample a graph from a graphon. Like a weighted graph (sample), the nodes are sampled uniformly from the unit interval ( $u_i\sim U[0,1]$ ).

The edges are sampled as

So the resulting graph is undirected and unweighted .