{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:11:49Z","timestamp":1754111509989,"version":"3.37.3"},"reference-count":41,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100003246","name":"NWO","doi-asserted-by":"publisher","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"NWO","doi-asserted-by":"publisher","award":["613.001.451"],"award-info":[{"award-number":["613.001.451"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"NWO","doi-asserted-by":"publisher","award":["639.033.806"],"award-info":[{"award-number":["639.033.806"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4,1]]},"DOI":"10.1093\/comnet\/cny013","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T12:13:36Z","timestamp":1530101616000},"page":"210-225","source":"Crossref","is-referenced-by-count":5,"title":["Switch chain mixing times and triangle counts in simple random graphs with given degrees"],"prefix":"10.1093","volume":"7","author":[{"given":"Tom","family":"Bannink","sequence":"first","affiliation":[{"name":"QuSoft and CWI, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remco","family":"van der Hofstad","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clara","family":"Stegehuis","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,8,16]]},"reference":[{"key":"2019042010330271800_B1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Internet: diameter of the world-wide web","volume":"401","author":"Albert","year":"1999","journal-title":"Nature"},{"key":"2019042010330271800_B2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the internet topology","volume":"29","author":"Faloutsos","year":"1999","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"2019042010330271800_B3","doi-asserted-by":"crossref","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","article-title":"Large-scale topological and dynamical properties of the internet","volume":"65","author":"V\u00e1zquez","year":"2002","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labeled graphs with given degree sequences","volume":"24","author":"Bender","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"2019042010330271800_B5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198709893.001.0001","volume-title":"Generating Random Networks and Graphs","author":"Coolen","year":"2017"},{"key":"2019042010330271800_B6","doi-asserted-by":"crossref","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","article-title":"Random graphs with arbitrary degree distributions and their applications","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0378-8733(00)00026-5","article-title":"Simple methods for simulating sociomatrices with given marginal totals","volume":"22","author":"Roberts","year":"2000","journal-title":"Social Networks"},{"key":"2019042010330271800_B8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"Eur. J. Combin."},{"key":"2019042010330271800_B9","doi-asserted-by":"crossref","DOI":"10.1017\/9781316779422","volume-title":"Random Graphs and Complex Networks","author":"van der Hofstad","year":"2017"},{"key":"2019042010330271800_B10","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","article-title":"Generating simple random graphs with prescribed degree distribution","volume":"124","author":"Britton","year":"2006","journal-title":"J. Stat. Phys."},{"key":"2019042010330271800_B11","doi-asserted-by":"crossref","first-page":"036112","DOI":"10.1103\/PhysRevE.68.036112","article-title":"Class of correlated random networks with hidden variables","volume":"68","author":"Bogu\u00f1\u00e1","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B12","doi-asserted-by":"crossref","first-page":"15879","DOI":"10.1073\/pnas.252631999","article-title":"The average distances in random graphs with given expected degrees","volume":"99","author":"Chung","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019042010330271800_B13","doi-asserted-by":"crossref","first-page":"023052","DOI":"10.1088\/1367-2630\/17\/2\/023052","article-title":"Unbiased sampling of network ensembles","volume":"17","author":"Squartini","year":"2015","journal-title":"New J. Phys."},{"key":"2019042010330271800_B14","first-page":"337","article-title":"Switching edges to randomize networks: what goes wrong and how to fix it","volume":"5","author":"Carstens","year":"2017","journal-title":"J. Complex Netw."},{"key":"2019042010330271800_B15","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1007\/s10955-009-9821-2","article-title":"Constrained markovian dynamics of random graphs","volume":"136","author":"Coolen","year":"2009","journal-title":"J. Stat. Phys."},{"key":"2019042010330271800_B16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2017.11.010","article-title":"The switch markov chain for sampling irregular graphs and digraphs","volume":"719","author":"Greenhill","year":"2018","journal-title":"Theoret. Comput. Sci."},{"article-title":"On the uniform generation of random graphs with prescribed degree sequences.","year":"2003","author":"Milo","key":"2019042010330271800_B17"},{"key":"2019042010330271800_B18","doi-asserted-by":"crossref","first-page":"056708","DOI":"10.1103\/PhysRevE.72.056708","article-title":"Generating uniformly distributed random networks","volume":"72","author":"Artzy-Randrup","year":"2005","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B19","doi-asserted-by":"crossref","first-page":"046103","DOI":"10.1103\/PhysRevE.85.046103","article-title":"Unbiased degree preserving randomization of directed binary networks","volume":"85","author":"Roberts","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B20","first-page":"16","article-title":"The markov chain simulation method for generating connected power law random graphs","volume-title":"Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments","author":"Gkantsidis","year":"2003"},{"article-title":"Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence.","year":"2016","author":"Carstens","key":"2019042010330271800_B21"},{"key":"2019042010330271800_B22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1890\/03-0101","article-title":"Randomization of presence\u2013absence matrices: comments and new algorithms","volume":"85","author":"Mikl\u00f3s","year":"2004","journal-title":"Ecology"},{"key":"2019042010330271800_B23","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s004420100717","article-title":"Swap and fill algorithms in null model analysis: rethinking the knight\u2019s tour","volume":"129","author":"Gotelli","year":"2001","journal-title":"Oecologia"},{"key":"2019042010330271800_B24","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1038\/srep02517","article-title":"Deciphering the global organization of clustering in real complex networks","volume":"3","author":"Colomer-de Sim\u00f3n","year":"2013","journal-title":"Sci. Rep."},{"key":"2019042010330271800_B25","doi-asserted-by":"crossref","first-page":"026112","DOI":"10.1103\/PhysRevE.67.026112","article-title":"Hierarchical organization in complex networks","volume":"67","author":"Ravasz","year":"2003","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B26","doi-asserted-by":"crossref","first-page":"208302","DOI":"10.1103\/PhysRevLett.116.208302","article-title":"Clustering implies geometry in networks","volume":"116","author":"Krioukov","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"2019042010330271800_B27","doi-asserted-by":"crossref","first-page":"088701","DOI":"10.1103\/PhysRevLett.97.088701","article-title":"Percolation and epidemic thresholds in clustered networks","volume":"97","author":"Serrano","year":"2006","journal-title":"Phys. Rev. Lett."},{"article-title":"Optimal subgraph structures in scale-free networks.","year":"2017","author":"van der Hofstad","key":"2019042010330271800_B28"},{"key":"2019042010330271800_B29","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":"2019042010330271800_B30","doi-asserted-by":"crossref","first-page":"e0147935","DOI":"10.1371\/journal.pone.0147935","article-title":"marathon: An open source software library for the analysis of Markov-chain monte carlo algorithms","volume":"11","author":"Rechner","year":"2016","journal-title":"PloS One"},{"key":"2019042010330271800_B31","doi-asserted-by":"crossref","first-page":"022807","DOI":"10.1103\/PhysRevE.89.022807","article-title":"Fluctuation analysis in complex networks modeled by hidden-variable models: necessity of a large cutoff in hidden-variable models","volume":"89","author":"Ostilli","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B32","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","article-title":"Power-law distributions in empirical data","volume":"51","author":"Clauset","year":"2009","journal-title":"SIAM Rev."},{"key":"2019042010330271800_B33","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph. I","volume":"10","author":"Hakimi","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"2019042010330271800_B34","article-title":"Are we there yet? when to stop a Markov chain while generating random graphs","author":"Ray","year":"2012","journal-title":"CoRR"},{"key":"2019042010330271800_B35","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1002\/rsa.20063","article-title":"Distances in random graphs with finite variance degrees","volume":"27","author":"van der Hofstad","year":"2005","journal-title":"Random Struct. Algorithms"},{"key":"2019042010330271800_B36","doi-asserted-by":"crossref","DOI":"10.1007\/s10955-018-1952-x","article-title":"Triadic closure in configuration models with unbounded degree fluctuations.","author":"van der Hofstad","year":"2018","journal-title":"J. Stat. Phys."},{"key":"2019042010330271800_B37","first-page":"2489","article-title":"Subgraphs of random graphs with specified degrees","volume-title":"Proceedings of the International Congress of Mathematicians","author":"McKay","year":"2010"},{"key":"2019042010330271800_B38","doi-asserted-by":"crossref","first-page":"022307","DOI":"10.1103\/PhysRevE.95.022307","article-title":"Local clustering in scale-free networks with hidden variables","volume":"95","author":"van der Hofstad","year":"2017","journal-title":"Phys. Rev. E"},{"key":"2019042010330271800_B39","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1016\/j.ejc.2012.01.009","article-title":"Induced subgraphs in sparse random graphs with given degree sequences","volume":"33","author":"Gao","year":"2012","journal-title":"Eur. J. Combin."},{"key":"2019042010330271800_B40","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1017\/S0963548311000034","article-title":"Subgraphs of dense random graphs with specified degrees","volume":"20","author":"McKay","year":"2011","journal-title":"Combin. Prob. Comput."},{"key":"2019042010330271800_B41","doi-asserted-by":"crossref","first-page":"R66","DOI":"10.37236\/1819","article-title":"Short cycles in random regular graphs","volume":"11","author":"McKay","year":"2004","journal-title":"Electron. J. Comb."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/2\/210\/28490316\/cny013.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T11:43:14Z","timestamp":1604490194000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/7\/2\/210\/5075427"}},"subtitle":[],"editor":[{"given":"Jose","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,8,16]]},"references-count":41,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,8,16]]},"published-print":{"date-parts":[[2019,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cny013","relation":{},"ISSN":["2051-1329"],"issn-type":[{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2019,4]]},"published":{"date-parts":[[2018,8,16]]}}}