{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:08:48Z","timestamp":1770289728103,"version":"3.49.0"},"reference-count":45,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T00:00:00Z","timestamp":1752278400000},"content-version":"vor","delay-in-days":16,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["0.379"],"award-info":[{"award-number":["0.379"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Comparative analysis between a network and a random graph model can uncover network properties that significantly deviate from those in random networks. The standard random graph model used for comparison uniformly samples random graphs with the same degrees as the network data, often achieved through edge-swap algorithms. However, for hypergraphs, fewer such methodologies are available. This study introduces the Hypercurveball algorithm, designed to sample random, potentially directed, hypergraphs with fixed degrees. Minor adjustments enable the sampling of hypergraphs without degenerate hyperedges, self-loops, or multi-hyperedges. For most of these algorithms, we prove whether they sample uniformly or with bias. We experimentally show that the Hypercurveball algorithm can be significantly faster or slower than the standard hyperedge-shuffling algorithm, which is the hyperedge-equivalent of the edge-swap algorithm. We present criteria on the hypergraph degree sequence that indicate when the Hypercurveball algorithm is more efficient than the standard hyperedge-shuffling method. Finally, our experimental results suggest polynomial scaling of the mixing time for both the Hypercurveball and hyperedge-shuffling algorithms.<\/jats:p>","DOI":"10.1093\/comnet\/cnaf007","type":"journal-article","created":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T14:12:51Z","timestamp":1752329571000},"source":"Crossref","is-referenced-by-count":1,"title":["Hypercurveball algorithm for sampling hypergraphs with fixed degrees"],"prefix":"10.1093","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1130-8049","authenticated-orcid":false,"given":"Yanna J","family":"Kraakman","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente , Drienerlolaan 5 , Enschede 7522 NB,","place":["The Netherlands"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3951-5653","authenticated-orcid":false,"given":"Clara","family":"Stegehuis","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente , Drienerlolaan 5 , Enschede 7522 NB,","place":["The Netherlands"]}]}],"member":"286","published-online":{"date-parts":[[2025,7,12]]},"reference":[{"key":"2025071408372891900_cnaf007-B1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman","year":"2018"},{"key":"2025071408372891900_cnaf007-B2","doi-asserted-by":"publisher","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"},{"key":"2025071408372891900_cnaf007-B3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/16M1087175","article-title":"Configuring Random Graph Models with Fixed Degree Sequences","volume":"60","author":"Fosdick","year":"2018","journal-title":"SIAM Rev"},{"issue":"3","key":"2025071408372891900_cnaf007-B4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/comnet\/cnw027","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":"2025071408372891900_cnaf007-B5","volume-title":"Markov Chains and Mixing Times","author":"Levin","year":"2009"},{"key":"2025071408372891900_cnaf007-B6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1017\/S0963548306007978","article-title":"Sampling Regular Graphs and a Peer-to-Peer Network","volume":"16","author":"Cooper","year":"2007","journal-title":"Combinator Probab Comp"},{"key":"2025071408372891900_cnaf007-B7","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.5555\/2722129.2722232","author":"Greenhill","year":"2015"},{"key":"2025071408372891900_cnaf007-B8","doi-asserted-by":"publisher","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":"Electronic J Combin"},{"key":"2025071408372891900_cnaf007-B9","author":"Milo","year":"2004"},{"key":"2025071408372891900_cnaf007-B10","volume-title":"Bayesian Data Analysis","author":"Gelman","year":"2014","edition":"3rd edn"},{"key":"2025071408372891900_cnaf007-B11","doi-asserted-by":"publisher","DOI":"10.1007\/s11336-008-9062-3","article-title":"An efficient MCMC algorithm to sample binary matrices with fixed marginals","volume":"73","author":"Verhelst","year":"2008","journal-title":"Psychometrika"},{"key":"2025071408372891900_cnaf007-B12","doi-asserted-by":"publisher","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":"Nat Commun"},{"key":"2025071408372891900_cnaf007-B13","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.mex.2018.06.018","article-title":"A unifying framework for fast randomization of ecological networks with fixed (node) degrees","volume":"5","author":"Carstens","year":"2018","journal-title":"MethodsX"},{"key":"2025071408372891900_cnaf007-B14","doi-asserted-by":"publisher","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":"2025071408372891900_cnaf007-B15","author":"Carstens","year":"2016"},{"key":"2025071408372891900_cnaf007-B16","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","article-title":"The physics of higher-order interactions in complex systems","volume":"17","author":"Battiston","year":"2021","journal-title":"Nat Phys"},{"key":"2025071408372891900_cnaf007-B17","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/21M1414024","article-title":"What are higher-order networks?","volume":"65","author":"Bick","year":"2023","journal-title":"SIAM Rev"},{"key":"2025071408372891900_cnaf007-B18","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2022.0043","article-title":"Dynamics on higher-order networks: a review","volume":"19","author":"Majhi","year":"2022","journal-title":"J R Soc Interface"},{"key":"2025071408372891900_cnaf007-B19","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-022-00858-7","article-title":"Higher-order motif analysis in hypergraphs","volume":"5","author":"Lotito","year":"2022","journal-title":"Commun Phys"},{"key":"2025071408372891900_cnaf007-B20","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-37190-9","article-title":"Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes","volume":"14","author":"Zhang","year":"2023","journal-title":"Nat Commun"},{"key":"2025071408372891900_cnaf007-B21","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa018","article-title":"Configuration models of random hypergraphs","volume":"8","author":"Chodrow","year":"2020","journal-title":"J Complex Netw"},{"key":"2025071408372891900_cnaf007-B22","author":"Kraakman","year":"2024"},{"key":"2025071408372891900_cnaf007-B23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4","article-title":"Simple Markov-chain algorithms for generating bipartite graphs and tournaments","volume":"14","author":"Kannan","year":"1999","journal-title":"Random Struct Algorithms"},{"key":"2025071408372891900_cnaf007-B24","doi-asserted-by":"publisher","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":"Theor Comput Sci"},{"key":"2025071408372891900_cnaf007-B25","doi-asserted-by":"publisher","author":"Kraakman","year":"2025","DOI":"10.4121\/9beea11f-2e93-473d-9d22-8d8a6bec9d5a"},{"key":"2025071408372891900_cnaf007-B26","doi-asserted-by":"publisher","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 Combinatorics"},{"key":"2025071408372891900_cnaf007-B27","doi-asserted-by":"publisher","author":"Kunegis","year":"2013","DOI":"10.1145\/2487788.2488173"},{"key":"2025071408372891900_cnaf007-B28","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.scaman.2010.10.002","article-title":"For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway","volume":"27","author":"Seierstad","year":"2011","journal-title":"Scand J Manag"},{"key":"2025071408372891900_cnaf007-B29","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2025071408372891900_cnaf007-B30","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1038\/nature19776","article-title":"Autocatalytic, bistable, oscillatory networks of biologically relevant organic reactions","volume":"537","author":"Semenov","year":"2016","journal-title":"Nature"},{"key":"2025071408372891900_cnaf007-B31","doi-asserted-by":"publisher","author":"Yadati","year":"2020","DOI":"10.1145\/3340531.3411870"},{"key":"2025071408372891900_cnaf007-B32","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0378-8733(96)00300-0","article-title":"Centrality in affiliation networks","volume":"19","author":"Faust","year":"1997","journal-title":"Soc Netw"},{"key":"2025071408372891900_cnaf007-B33","first-page":"4","article-title":"Structural redundancy and multiplicity in corporate networks","volume":"30","author":"Barnes","year":"2010","journal-title":"Int Netw Soc Netw Anal"},{"key":"2025071408372891900_cnaf007-B34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1080\/1057610X.2014.872021","article-title":"Assessing the Abu Sayyaf Group\u2019s strategic and learning capacities","volume":"37","author":"Gerdes","year":"2014","journal-title":"Studies Conflict Terrorism"},{"key":"2025071408372891900_cnaf007-B35","first-page":"4","article-title":"Insect-flower relationship in the primary beech forest of Ashu, Kyoto: an overview of the flowering phenology and seasonal pattern of insect visits","volume":"27","author":"Makoto","year":"1990","journal-title":"Contrib Biol Lab Kyoto Univ"},{"key":"2025071408372891900_cnaf007-B36","author":"Decker S, Kohfeld CW, Rosenfeld","year":"1991"},{"key":"2025071408372891900_cnaf007-B37","doi-asserted-by":"publisher","author":"Robertson","year":"1929","DOI":"10.5962\/bhl.title.11538"},{"key":"2025071408372891900_cnaf007-B38","doi-asserted-by":"publisher","author":"Yang","year":"2013","DOI":"10.1145\/2493432.2493464"},{"key":"2025071408372891900_cnaf007-B39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176","article-title":"High-resolution measurements of face-to-face contact patterns in a primary school","volume":"6","author":"Stehl\u00e9","year":"2011","journal-title":"PLoS ONE"},{"key":"2025071408372891900_cnaf007-B40","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.socnet.2005.11.003","article-title":"Legislative cosponsorship networks in the US House and Senate","volume":"28","author":"Fowler","year":"2006","journal-title":"Soc Netw"},{"key":"2025071408372891900_cnaf007-B41","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abh1303","article-title":"Generative hypergraph clustering: from blockmodels to modularity","volume":"7","author":"Chodrow","year":"2021","journal-title":"Sci Adv"},{"key":"2025071408372891900_cnaf007-B42","author":"Ni","year":"2019"},{"key":"2025071408372891900_cnaf007-B43","author":"Amburg","year":"2022"},{"key":"2025071408372891900_cnaf007-B44","doi-asserted-by":"publisher","author":"Benson","year":"2018","DOI":"10.1145\/3159652.3159702"},{"key":"2025071408372891900_cnaf007-B45","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-16926-7_21","author":"Berger","year":"2010"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/4\/cnaf007\/63734994\/cnaf007.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/4\/cnaf007\/63734994\/cnaf007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T12:37:38Z","timestamp":1752496658000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnaf007\/8197996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,26]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,6,26]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnaf007","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,8]]},"published":{"date-parts":[[2025,6,26]]},"article-number":"cnaf007"}}