A study of the edge-switching Markov-chain method for the generation of random graphs
<|reference_start|>A study of the edge-switching Markov-chain method for the generation of random graphs: We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose functioning depends on a parameter w related to the method's core operation of an edge switch. We analyze two existing heuristics for adjusting w during the generation of a graph and show that they result in a Markov chain whose stationary distribution is uniform, thus ensuring that generation occurs uniformly at random. We also introduce a novel w-adjusting heuristic which, even though it does not always lead to a Markov chain, is still guaranteed to converge to the uniform distribution under relatively mild conditions. We report on extensive computer experiments comparing the three heuristics' performance at generating random graphs whose node degrees are distributed as power laws.<|reference_end|>
@article{stauffer2005a,
    title={A study of the edge-switching Markov-chain method for the generation of
  random graphs},
    author={Alexandre O. Stauffer, Valmir C. Barbosa},
    journal={arXiv preprint arXiv:cs/0512105},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512105},
    primaryClass={cs.DM}
}