Sampling uniform simple graphs with power-law degree distributions with degree exponent τ∈(2,3) is a non-trivial problem. Firstly, we propose a method to sample uniform simple graphs that uses a constrained version of the configuration model together with a Markov Chain switching method. We test the convergence of this algorithm numerically in the context of the presence of small subgraphs and we estimate the mixing time to be at most O(n log2 n)⁠. Secondly, we compare the number of triangles in uniform random graphs with the number of triangles in the erased configuration model where double edges and self-loops of the configuration model are removed. Using simulations and heuristic arguments, we conjecture that the number of triangles in the erased configuration model is larger than the number of triangles in the uniform random graph, provided that the graph is sufficiently large. Lastly, we argue that certain switch-chain-based proof methods can not be used in the regime τ∈(2,3) due to the possibility of creating many triangles with a single switch.
Additional Metadata
Stakeholder QuSoft, Amsterdam, the Netherlands
Persistent URL dx.doi.org/10.1093/comnet/cny013
Journal Journal of Complex Networks
Citation
Bannink, T.R, van der Hofstad, R.W, & Stegehuis, C. (2018). Switch chain mixing times and triangle counts in simple random graphs with given degrees. Journal of Complex Networks, 7(2), 210–225. doi:10.1093/comnet/cny013