{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:27:22Z","timestamp":1769268442674,"version":"3.49.0"},"reference-count":34,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"DOI":"10.1093\/comnet\/cnw027","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T00:19:53Z","timestamp":1476490793000},"page":"cnw027","source":"Crossref","is-referenced-by-count":2,"title":["Switching edges to randomize networks: what goes wrong and how to fix it"],"prefix":"10.1093","author":[{"given":"C. J.","family":"Carstens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. J.","family":"Horadam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,10,13]]},"reference":[{"key":"2016101417192419000_cnw027v1.1","doi-asserted-by":"crossref","unstructured":"Artzy-Randrup Y. & Stone L. (2005) Generating uniformly distributed random networks. Phys. Rev. E, 72, 056708.","DOI":"10.1103\/PhysRevE.72.056708"},{"key":"2016101417192419000_cnw027v1.2","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu028"},{"key":"2016101417192419000_cnw027v1.3","doi-asserted-by":"crossref","unstructured":"Carstens C. J. (2015) Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast curveball algorithm. Phys. Rev. E, 91, 042812.","DOI":"10.1103\/PhysRevE.91.042812"},{"key":"2016101417192419000_cnw027v1.4","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"},{"key":"2016101417192419000_cnw027v1.5","doi-asserted-by":"crossref","unstructured":"Newman M. E. J. Strogatz S. H. & Watts D. J. (2001) Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E, 64, 026118.","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"2016101417192419000_cnw027v1.6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294482"},{"key":"2016101417192419000_cnw027v1.7","doi-asserted-by":"crossref","unstructured":"King O. D. (2004) Comment on \u201csubgraphs in random networks\u201d. Phys. Rev. E, 70, 058101.","DOI":"10.1103\/PhysRevE.70.058101"},{"key":"2016101417192419000_cnw027v1.8","doi-asserted-by":"crossref","unstructured":"Klein-Hennig, H. & Hartmann A. K. (2012) Bias in generation of random graphs. Phys. Rev. E, 85, 026101.","DOI":"10.1103\/PhysRevE.85.026101"},{"key":"2016101417192419000_cnw027v1.9","doi-asserted-by":"publisher","DOI":"10.1890\/03-0101"},{"key":"2016101417192419000_cnw027v1.10","unstructured":"Milo R. Kashtan N. Itzkovitz S. Newman M. E. J. & Alon U. (2003) On the uniform generation of random graphs with prescribed degree sequences. arXiv preprint arXiv:cond-mat\/0312028."},{"key":"2016101417192419000_cnw027v1.11","doi-asserted-by":"publisher","DOI":"10.1126\/science.1065103"},{"key":"2016101417192419000_cnw027v1.12","first-page":"225","article-title":"A Markov chain Monte Carlo method for generating random (0, 1)-matrices with given marginals.","volume":"58,","author":"Rao","year":"(1996)","journal-title":"Sankhya Indian J. Stat. Ser. A,"},{"key":"2016101417192419000_cnw027v1.13","doi-asserted-by":"crossref","unstructured":"Roberts E. S. & Coolen A. C. C. (2012) Unbiased degree-preserving randomization of directed binary networks. Phys. Rev. E, 85, 046103.","DOI":"10.1103\/PhysRevE.85.046103"},{"key":"2016101417192419000_cnw027v1.14","doi-asserted-by":"crossref","unstructured":"Taylor R. (1981) Constrained switchings in graphs. Combinatorial Mathematics VIII. Berlin: Springer, pp. 314\u2013336.","DOI":"10.1007\/BFb0091828"},{"key":"2016101417192419000_cnw027v1.15","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"2016101417192419000_cnw027v1.16","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"2016101417192419000_cnw027v1.17","doi-asserted-by":"crossref","first-page":"P234","DOI":"10.37236\/721","article-title":"A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs.","volume":"18,","author":"Greenhill","year":"(2011)","journal-title":"Electron. J. Combin.,"},{"key":"2016101417192419000_cnw027v1.18","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G"},{"key":"2016101417192419000_cnw027v1.19","doi-asserted-by":"crossref","first-page":"P16","DOI":"10.37236\/3028","article-title":"Towards random uniform sampling of bipartite graphs with given degree sequence.","volume":"20,","author":"Mikl\u00f3s","year":"(2013)","journal-title":"Electron. J. Combin.,"},{"key":"2016101417192419000_cnw027v1.20","doi-asserted-by":"crossref","unstructured":"Rechner S. & Berger A. (2016) Marathon: an open source software library for the analysis of markov-chain monte carlo algorithms. PLoS One, 11, e0147935.","DOI":"10.1371\/journal.pone.0147935"},{"key":"2016101417192419000_cnw027v1.21","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1093\/comnet\/cnu041","article-title":"A stopping criterion for Markov chains when generating independent random graphs.","volume":"3,","author":"Ray","year":"(2014)","journal-title":"J. Complex Netw.,"},{"key":"2016101417192419000_cnw027v1.22","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-009-9821-2"},{"key":"2016101417192419000_cnw027v1.23","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M. & Upfal E. (2005) Probability and Computing: Randomized Algorithms and Probabilistic Analysis. New York: Cambridge University Press.","DOI":"10.1017\/CBO9780511813603"},{"key":"2016101417192419000_cnw027v1.24","doi-asserted-by":"crossref","unstructured":"Berger A. & M\u00fcller-Hannemann M. (2010) Uniform sampling of digraphs with a fixed degree sequence. Graph Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Berlin: Springer, pp. 220\u2013231.","DOI":"10.1007\/978-3-642-16926-7_21"},{"key":"2016101417192419000_cnw027v1.25","doi-asserted-by":"crossref","unstructured":"Ryser H. J. (1963) Combinatorial mathematics. Carus Mathematical Monographs. The Mathematical Association of America, New York, NY: Wiley.","DOI":"10.5948\/UPO9781614440147"},{"key":"2016101417192419000_cnw027v1.26","unstructured":"Berger A. (2011) Directed degree sequences. Ph.D. Thesis, Martin-Luther University Halle-Wittenberg. Retrieved from http:\/\/wcms.itz.uni-halle.de\/download.php?down=22851&elem=1624638 (accessed on September 21, 2016)."},{"key":"2016101417192419000_cnw027v1.27","doi-asserted-by":"crossref","unstructured":"Roberts E. S. Annibale A. & Coolen A. C. C. (2014) Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties. Nonlinear Maps and Their Applications. New York: Springer, pp. 25\u201334.","DOI":"10.1007\/978-1-4614-9161-3_4"},{"key":"2016101417192419000_cnw027v1.28","unstructured":"Berger A. & M\u00fcller-Hannemann M. (2009) Uniform sampling of undirected and directed graphs with a fixed degree sequence. arXiv preprint arXiv:0912.0685."},{"key":"2016101417192419000_cnw027v1.29","doi-asserted-by":"crossref","unstructured":"Eggleton R. B. & Holton D. A. (1981) Simple and multigraphic realizations of degree sequences. Combinatorial Mathematics VIII ( McAvaney K. L. ed.). Berlin: Springer, pp. 155\u2013172.","DOI":"10.1007\/BFb0091817"},{"key":"2016101417192419000_cnw027v1.30","unstructured":"Eggleton R. B. & Holton D. A. (1979) The graph of type (0, $\\infty$ , $\\infty$ ) realizations of a graphic sequence. Combinatorial Mathematics VI ( Gr\u00e1cio C. Fournier-Prunaret D. Ueta T. & Nishio Y. eds), New York: Springer, pp. 41\u201354."},{"key":"2016101417192419000_cnw027v1.31","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"2016101417192419000_cnw027v1.32","unstructured":"Bunke H. Dickinson, P. J., Kraetzl M. & Wallis W. D. (2007) A Graph-Theoretic Approach to Enterprise Network Dynamics. Basel: Birkhauser."},{"key":"2016101417192419000_cnw027v1.33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30541-2_12"},{"key":"2016101417192419000_cnw027v1.34","unstructured":"Zhao J. (2013) Expand and contract: sampling graphs with given degrees and other combinatorial families. arXiv preprint arXiv:1308.6627."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/5\/3\/337\/17654918\/cnw027.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T13:07:01Z","timestamp":1692536821000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnw027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,13]]},"references-count":34,"alternative-id":["10.1093\/comnet\/cnw027"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnw027","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,13]]}}}