Switch chain mixing times through triangle counts

Sampling uniform simple graphs with power-law degree distributions with degree exponent τ∈(2,3) is a non-trivial problem. 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. We then compare the number of triangles in uniform random graphs with the number of triangles in the erased configuration model. 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