%0 Generic %1 milo2003uniform %A Milo, R. %A Kashtan, N. %A Itzkovitz, S. %A Newman, M. E. J. %A Alon, U. %D 2003 %K random-networks %T On the uniform generation of random graphs with prescribed degree sequences %U http://arxiv.org/abs/cond-mat/0312028 %X Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we briefly review two existing methods for the generation of random graphs with arbitrary degree sequences, which we call the ``switching'' and ``matching'' methods, and present a new method based on the ``go with the winners'' Monte Carlo method. The matching method may suffer from nonuniform sampling, while the switching method has no general theoretical bound on its mixing time. The ``go with the winners'' method has neither of these drawbacks, but is slow. It can however be used to evaluate the reliability of the other two methods and, by doing this, we demonstrate that the deviations of the switching and matching algorithms under realistic conditions are small compared to the ``go with the winners'' algorithm. Because of its combination of speed and accuracy we recommend the use of the switching method for most calculations.

@misc{milo2003uniform, abstract = {Random graphs with prescribed degree sequences have been widely used as a model of complex networks. Comparing an observed network to an ensemble of such graphs allows one to detect deviations from randomness in network properties. Here we briefly review two existing methods for the generation of random graphs with arbitrary degree sequences, which we call the ``switching'' and ``matching'' methods, and present a new method based on the ``go with the winners'' Monte Carlo method. The matching method may suffer from nonuniform sampling, while the switching method has no general theoretical bound on its mixing time. The ``go with the winners'' method has neither of these drawbacks, but is slow. It can however be used to evaluate the reliability of the other two methods and, by doing this, we demonstrate that the deviations of the switching and matching algorithms under realistic conditions are small compared to the ``go with the winners'' algorithm. Because of its combination of speed and accuracy we recommend the use of the switching method for most calculations.}, added-at = {2019-01-23T06:02:30.000+0100}, author = {Milo, R. and Kashtan, N. and Itzkovitz, S. and Newman, M. E. J. and Alon, U.}, biburl = {https://www.bibsonomy.org/bibtex/2e77a7de2074a464e12d8e89204f3e324/karthikraman}, description = {[cond-mat/0312028] On the uniform generation of random graphs with prescribed degree sequences}, interhash = {c2efaa89b002636c11644cbf6762721c}, intrahash = {e77a7de2074a464e12d8e89204f3e324}, keywords = {random-networks}, note = {cite arxiv:cond-mat/0312028}, timestamp = {2019-01-23T06:02:30.000+0100}, title = {On the uniform generation of random graphs with prescribed degree sequences}, url = {http://arxiv.org/abs/cond-mat/0312028}, year = 2003 }