Fig. 8
From: Intrinsic limitations in mainstream methods of identifying network motifs in biology
Example of a switch. The switching method, the most commonly used method for generating random graphs with a given degree sequence, utilises a Markov chain Monte Carlo (MCMC) edge switching algorithm. Given a network G, we choose two edges, (a, c) and (b, d), at random and switch them as depicted, provided no loops or parallel edges are generated. To sample from \( \mathbbm{S}(G), \) we simply perform this operation a large number of times