The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Generating constrained random graphs using multiple edge switches
[article]
2012
arXiv
pre-print
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily possible to access all graphs obeying some given con- straints through a classical switching procedure calling on pairs of edges. We therefore propose to get round this issue by generalizing this classical approach through the use of higher-order edge switches. This
arXiv:1012.3023v2
fatcat:pfwvxuzaovb67j4qgsudkj2uaa