Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
The uniform sampling of simple graphs matching a prescribed degree sequence is an important tool in network science, e.g., to construct graph generators or null-models. Here, the Edge Switching Markov Chain (ES-MC) is a common choice. Given an arbitrary simple graph with the required degree sequence, ES-MC carries out a …