{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T22:22:22Z","timestamp":1792189342129,"version":"4.4.0"},"reference-count":36,"publisher":"Public Library of Science (PLoS)","issue":"5","license":[{"start":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T00:00:00Z","timestamp":1715731200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["RRF2.3.1-21-2022-00004"],"award-info":[{"award-number":["RRF2.3.1-21-2022-00004"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011019","name":"NKFIH","doi-asserted-by":"crossref","award":["K132696"],"award-info":[{"award-number":["K132696"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["RRF2.3.1-21-2022-00006"],"award-info":[{"award-number":["RRF2.3.1-21-2022-00006"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"crossref","award":["RRF2.3.1-21-2022-00006"],"award-info":[{"award-number":["RRF2.3.1-21-2022-00006"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.plosone.org"],"crossmark-restriction":false},"short-container-title":["PLoS ONE"],"abstract":"<jats:p>Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such a hypergraph with prescribed degree sequences exists. We prove that this decision problem is NP-complete in general, and give a polynomial running time algorithm for third almost-regular degree sequences, that is, when each degree in one of the vertex classes is <jats:italic>k<\/jats:italic> or <jats:italic>k<\/jats:italic> \u2212 1 for some fixed <jats:italic>k<\/jats:italic>, and there is no restriction for the other two vertex classes. We also consider the sampling problem, that is, to uniformly sample partite, 3-uniform hypergraphs with prescribed degree sequences. We propose a Parallel Tempering method, where the hypothetical energy of the hypergraphs measures the deviation from the prescribed degree sequence. The method has been implemented and tested on synthetic and real data. It can also be applied for <jats:italic>\u03c7<\/jats:italic><jats:sup>2<\/jats:sup> testing of contingency tables. We have shown that this hypergraph-based <jats:italic>\u03c7<\/jats:italic><jats:sup>2<\/jats:sup> test is more sensitive than the standard <jats:italic>\u03c7<\/jats:italic><jats:sup>2<\/jats:sup> test. The extra sensitivity is especially advantageous on small data sets, where the proposed Parallel Tempering method shows promising performance.<\/jats:p>","DOI":"10.1371\/journal.pone.0303155","type":"journal-article","created":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T17:28:49Z","timestamp":1715794129000},"page":"e0303155","update-policy":"https:\/\/doi.org\/10.1371\/journal.pone.corrections_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence"],"prefix":"10.1371","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1941-7688","authenticated-orcid":true,"given":"Andr\u00e1s","family":"Hubai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7608-3215","authenticated-orcid":true,"given":"Tam\u00e1s R\u00f3bert","family":"Mezei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ferenc","family":"B\u00e9res","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e1s","family":"Bencz\u00far","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Istv\u00e1n","family":"Mikl\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"340","published-online":{"date-parts":[[2024,5,15]]},"reference":[{"key":"pone.0303155.ref001","first-page":"477","article-title":"A remark on the existence of finite graphs. (Czech). \u010casopis P\u011bst","volume":"80","author":"V Havel","year":"1955","journal-title":"Mat"},{"key":"pone.0303155.ref002","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On the realizability of a set of integers as degrees of the vertices of a simple graph","volume":"10","author":"SL Hakimi","year":"1962","journal-title":"J. SIAM Appl. Math"},{"key":"pone.0303155.ref003","first-page":"264","article-title":"Graphs with vertices of prescribed degrees (in Hungarian)","volume":"11","author":"P Erd\u0151s","year":"1960","journal-title":"Matematikai Lapok"},{"issue":"2","key":"pone.0303155.ref004","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","article-title":"A theorem on flows in networks","author":"D Gale","year":"1957","journal-title":"Pacific J. Math"},{"key":"pone.0303155.ref005","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","article-title":"Combinatorial properties of matrices of zeros and ones","volume":"9","author":"HJ Ryser","year":"1957","journal-title":"Canad. J. Math"},{"key":"pone.0303155.ref006","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.1137\/17M1134482","article-title":"Optimization over degree sequences","volume":"32","author":"A Deza","year":"2018","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"pone.0303155.ref007","unstructured":"Deza A, Levin A, Meesum SM, Onn S. Hypergraphic degree sequences are hard. https:\/\/arxiv.org\/pdf\/1901.02272.pdf"},{"key":"pone.0303155.ref008","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/978-3-642-37067-0_26","volume-title":"Discrete Geometry for Computer Imagery","author":"A Frosini","year":"2013"},{"key":"pone.0303155.ref009","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10851-022-01074-2","article-title":"On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two","volume":"64","author":"G Palma","year":"2022","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"3","key":"pone.0303155.ref010","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/rsa.21004","article-title":"Fast uniform generation of random graphs with given degree sequences","volume":"59","author":"A Arman","year":"2021","journal-title":"Random Structures and Algorithms"},{"key":"pone.0303155.ref011","doi-asserted-by":"crossref","unstructured":"Gao P, Wormald N. Uniform generation of random graphs with power-law degree sequences. in SODA\u201918: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. 2018;1741\u20131758.","DOI":"10.1137\/1.9781611975031.114"},{"key":"pone.0303155.ref012","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-540-27812-2_20","volume-title":"Theory Is Forever. Lecture Notes in Computer Science","author":"M Nivat","year":"2004"},{"issue":"1","key":"pone.0303155.ref013","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","article-title":"Monte Carlo sampling methods using Markov chains and their applications","volume":"57","author":"WK Hastings","year":"1970","journal-title":"Biometrika"},{"issue":"6","key":"pone.0303155.ref014","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"N Metropolis","year":"1953","journal-title":"J. Chem. Phys"},{"issue":"4","key":"pone.0303155.ref015","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","article-title":"Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments","volume":"14","author":"R Kannan","year":"1999","journal-title":"Random Structures Algorithms"},{"issue":"4","key":"pone.0303155.ref016","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":"C Cooper","year":"2007","journal-title":"Comp. Prob. Comp"},{"key":"pone.0303155.ref017","doi-asserted-by":"crossref","first-page":"103421","DOI":"10.1016\/j.ejc.2021.103421","article-title":"The mixing time of the switch Markov chains: a unified approach","volume":"99","author":"EL Erd\u0151s","year":"2022","journal-title":"Eur. J. Comb"},{"key":"pone.0303155.ref018","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1890\/03-0101","article-title":"Randomization of presence\/absence matrices: comments and new algorithms","volume":"85","author":"I Mikl\u00f3s","year":"2004","journal-title":"Ecology"},{"key":"pone.0303155.ref019","doi-asserted-by":"crossref","first-page":"8627","DOI":"10.1038\/ncomms9627","article-title":"Quantifying randomness in real networks","volume":"6","author":"C Orsini","year":"2015","journal-title":"Nature Communications"},{"issue":"1","key":"pone.0303155.ref020","first-page":"131","article-title":"A Survey of Exact Inference for Contingency Tables","volume":"7","author":"A Agresti","year":"1992","journal-title":"Statistical Science"},{"issue":"1","key":"pone.0303155.ref021","doi-asserted-by":"crossref","first-page":"87","DOI":"10.2307\/2340521","article-title":"On the interpretation of \u03c72 from contingency tables, and the calculation of P","volume":"85","author":"RA Fisher","year":"1922","journal-title":"Journal of the Royal Statistical Society"},{"issue":"3","key":"pone.0303155.ref022","doi-asserted-by":"crossref","first-page":"cnaa018","DOI":"10.1093\/comnet\/cnaa018","article-title":"Configuration models of random hypergraphs","volume":"8","author":"PS Chodrow","year":"2020","journal-title":"Journal of Complex Networks"},{"key":"pone.0303155.ref023","unstructured":"Arafat NA, Basu D, Decreusefond L, Bressan S. Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences. https:\/\/arxiv.org\/abs\/2004.05429"},{"issue":"11","key":"pone.0303155.ref024","doi-asserted-by":"crossref","first-page":"112566","DOI":"10.1016\/j.disc.2021.112566","article-title":"Sampling hypergraphs with given degrees","volume":"344","author":"M Dyer","year":"2021","journal-title":"Discrete Mathematics"},{"key":"pone.0303155.ref025","first-page":"145","article-title":"On 3-Hypergraphs with Equal Degree Sequences","volume":"82","author":"WL Kocay","year":"2006","journal-title":"Ars Combinatoria"},{"key":"pone.0303155.ref026","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.dam.2020.10.020","article-title":"On null 3-hypergraphs","volume":"303","author":"A Frosini","year":"2021","journal-title":"Discrete Applied Mathematics"},{"key":"pone.0303155.ref027","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979"},{"key":"pone.0303155.ref028","first-page":"156","article-title":"Parallel tempering: Theory, applications, and new perspectives","author":"CJ Geyer","year":"1991","journal-title":"Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface"},{"key":"pone.0303155.ref029","volume-title":"Springer Series in Statistics","author":"JS Liu","year":"2001"},{"issue":"1","key":"pone.0303155.ref030","first-page":"1","article-title":"Network embedding aided vaccine skepticism detection","volume":"8","author":"F B\u00e9res","journal-title":"Applied Network Science"},{"issue":"4","key":"pone.0303155.ref031","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1556\/112.2021.00066","article-title":"COVID Vaccine Sentiment Dashboard based on Twitter Data","volume":"2","author":"F B\u00e9res","journal-title":"Scientia et Securitas"},{"key":"pone.0303155.ref032","doi-asserted-by":"crossref","first-page":"3012","DOI":"10.1093\/bioinformatics\/btq574","article-title":"Bayesian Sampling of Genomic Rearrangement Scenarios via Double Cut and Join","volume":"26","author":"I Mikl\u00f3s","year":"2010","journal-title":"Bioinformatics"},{"issue":"1-2","key":"pone.0303155.ref033","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1002\/rsa.20155","article-title":"Sampling binary contingency tables with a greedy start","volume":"30","author":"I Bez\u00e1kov\u00e1","year":"2007","journal-title":"Random Structures & Algorithms"},{"key":"pone.0303155.ref034","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/130929874","article-title":"A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix","volume":"29","author":"EL Erd\u0151s","year":"2015","journal-title":"SIAM J. Discr. Math"},{"key":"pone.0303155.ref035","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1214\/EJP.v14-638","article-title":"Sufficient Conditions for Torpid Mixing of Parallel and Simulated Tempering","volume":"14","author":"D Woodard","year":"2009","journal-title":"Electron. J. Probab"},{"issue":"2","key":"pone.0303155.ref036","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1214\/08-AAP555","article-title":"Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions","volume":"19","author":"D Woodard","year":"2009","journal-title":"The Annals of Applied Probability"}],"container-title":["PLOS ONE"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0303155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T17:29:14Z","timestamp":1715794154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0303155"}},"subtitle":[],"editor":[{"given":"Ismael","family":"Gonz\u00e1lez Yero","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2024,5,15]]},"references-count":36,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5,15]]}},"URL":"https:\/\/doi.org\/10.1371\/journal.pone.0303155","relation":{},"ISSN":["1932-6203"],"issn-type":[{"value":"1932-6203","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,15]]}}}