{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:06:31Z","timestamp":1774623991517,"version":"3.50.1"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T00:00:00Z","timestamp":1523232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12,1]]},"DOI":"10.1093\/comnet\/cny008","type":"journal-article","created":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T04:17:33Z","timestamp":1521865053000},"page":"927-947","source":"Crossref","is-referenced-by-count":6,"title":["The connectivity of graphs of graphs with self-loops and a given degree sequence"],"prefix":"10.1093","volume":"6","author":[{"given":"Joel","family":"Nishimura","sequence":"first","affiliation":[{"name":"School of Mathematical and Natural Sciences Arizona State University, Glendale, 4701 W. Thunderbird Rd, Glendale, AZ, USA"}]}],"member":"286","published-online":{"date-parts":[[2018,4,9]]},"reference":[{"key":"key\n\t\t\t\t2019030404255997600_B1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/rsa.3240060204","article-title":"A critical point for random graphs with a given degree sequence.","volume":"6","author":"Molloy","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"key\n\t\t\t\t2019030404255997600_B2","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":"key\n\t\t\t\t2019030404255997600_B3","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":"key\n\t\t\t\t2019030404255997600_B4","article-title":"Configuring random graph models with fixed degree sequences.","author":"Fosdick","year":"2016","journal-title":"preprint"},{"key":"key\n\t\t\t\t2019030404255997600_B5","doi-asserted-by":"crossref","first-page":"4569","DOI":"10.1073\/pnas.061034498","article-title":"A comprehensive two-hybrid analysis to explore the yeast protein interactome.","volume":"98","author":"Ito","year":"2001","journal-title":"Proc. Natl. Acad. Sci."},{"key":"key\n\t\t\t\t2019030404255997600_B6","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1126\/science.1158684","article-title":"High-quality binary protein interaction map of the yeast interactome network.","volume":"322","author":"Yu","year":"2008","journal-title":"Science"},{"key":"key\n\t\t\t\t2019030404255997600_B7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","article-title":"Network motifs in the transcriptional regulation network of","volume":"31","author":"Shen-Orr","year":"2002","journal-title":"escherichia coli. Nat. Genet."},{"key":"key\n\t\t\t\t2019030404255997600_B8","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1890\/11-0374.1","article-title":"Food web including metazoan parasites for a brackish shallow water ecosystem in Germany and Denmark.","volume":"92","author":"Zander","year":"2011","journal-title":"Ecology"},{"key":"key\n\t\t\t\t2019030404255997600_B9","first-page":"395","volume-title":"Implementation Challenge for Shortest Paths.","author":"Demetrescu","year":"2008"},{"key":"key\n\t\t\t\t2019030404255997600_B10","first-page":"2","article-title":"Graph evolution: densification and shrinking diameters.","volume":"1","author":"Leskovec","year":"2007","journal-title":"Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining"},{"key":"key\n\t\t\t\t2019030404255997600_B11","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. Comb."},{"key":"key\n\t\t\t\t2019030404255997600_B12","doi-asserted-by":"crossref","first-page":"042812","DOI":"10.1103\/PhysRevE.91.042812","article-title":"Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast curveball algorithm.","volume":"91","author":"Carstens","year":"2015","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t2019030404255997600_B13","article-title":"Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence.","author":"Carstens","year":"2016","journal-title":"arXiv preprint arXiv:1609.05137"},{"key":"key\n\t\t\t\t2019030404255997600_B14","doi-asserted-by":"crossref","first-page":"4114","DOI":"10.1038\/ncomms5114","article-title":"A fast and unbiased procedure to randomize ecological binary matrices with fixed row and column totals.","volume":"5","author":"Strona","year":"2014","journal-title":"Nature Commun."},{"key":"key\n\t\t\t\t2019030404255997600_B15","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1017\/S0963548306007978","article-title":"Sampling regular graphs and a peer-to-peer network.","volume":"16","author":"Cooper","year":"2017","journal-title":"Comb. Probab. Comput."},{"key":"key\n\t\t\t\t2019030404255997600_B16","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1137\/1.9781611973730.103","article-title":"The switch Markov chain for sampling irregular graphs.","author":"Greenhill","year":"2015","journal-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"key\n\t\t\t\t2019030404255997600_B17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","article-title":"Uniform generation of random regular graphs of moderate degree.","volume":"11","author":"McKay","year":"1990","journal-title":"J. Algorithms"},{"key":"key\n\t\t\t\t2019030404255997600_B18","volume-title":"Theory of Graphs and Its Applications","author":"Berge","year":"1962"},{"key":"key\n\t\t\t\t2019030404255997600_B19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230240402","article-title":"A degree sequence problem related to network design.","volume":"24","author":"Bienstock","year":"1994","journal-title":"Networks"},{"key":"key\n\t\t\t\t2019030404255997600_B20","first-page":"155","volume-title":"Simple and Multigraphic Realizations of Degree Sequences","author":"Eggleton","year":"1981"},{"key":"key\n\t\t\t\t2019030404255997600_B21","first-page":"314","volume-title":"Constrained Switchings in Graphs","author":"Taylor","year":"1981"},{"key":"key\n\t\t\t\t2019030404255997600_B22","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1049\/el.2010.3411","article-title":"Traversability of graph space with given degree sequence under edge rewiring.","volume":"46","author":"Zhang","year":"2010","journal-title":"Electron. Lett."},{"key":"key\n\t\t\t\t2019030404255997600_B23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0111010","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph II. Uniqueness.","volume":"11","author":"Hakimi","year":"1963","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"key\n\t\t\t\t2019030404255997600_B24","first-page":"41","volume-title":"The Graph of Type (0,\u221e,\u221e) Realizations of a Graphic Sequence","author":"Eggleton","year":"1979"},{"key":"key\n\t\t\t\t2019030404255997600_B25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die theorie der regul\u00e4ren graphs.","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/6\/6\/927\/28007566\/cny008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T19:29:00Z","timestamp":1693596540000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/6\/6\/927\/4964853"}},"subtitle":[],"editor":[{"given":"Matthieu","family":"Latapy","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,4,9]]},"references-count":25,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2018,4,9]]},"published-print":{"date-parts":[[2018,12,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cny008","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,12]]},"published":{"date-parts":[[2018,4,9]]}}}