Preprint
Aug 2026
Unified framework for asymptotically uniform iterative construction of generalised random graphs with local constraints
The main theorem gives the asymptotic sampling distribution and enumeration formulae for configurations, and accommodates forbidden edges, and enables the sampling of edge-colored graphs with prescribed degree sequences for each color class by constructing the colored subgraphs one at a time.
I. Kryven, Rik Versendaal, Mike de Vries
· 0 citations