Random k-out graph
= Random k-out graph
{title2=$G_{k\text{-out}}$}
Each <vertex> independently chooses $k$ distinct other <vertices> uniformly, and an undirected <edge> exists when either endpoint chooses the other. This has dependent undirected <edges> and is not a <binomial random graph>. Coupling the choices as the first $k$ entries of <independent> random permutations makes the <graphs> increasing in $k$.