{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:39:32Z","timestamp":1743122372012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590505"},{"type":"electronic","value":"9783030590512"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59051-2_9","type":"book-chapter","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T19:02:51Z","timestamp":1599937371000},"page":"130-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences"],"prefix":"10.1007","author":[{"given":"Naheed Anjum","family":"Arafat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debabrota","family":"Basu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Decreusefond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Batu, T., Canonne, C.L.: Generalized uniformity testing. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2017)","DOI":"10.1109\/FOCS.2017.86"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","volume":"24","author":"EA Bender","year":"1978","unstructured":"Bender, E.A., Canfield, E.R.: The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory, Ser. A 24(3), 296\u2013307 (1978)","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"48","key":"9_CR3","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Nat. Acad. Sci. 115(48), E11221\u2013E11230 (2018)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"9_CR4","unstructured":"Berge, C.: Graphs and Hypergraphs. Elsevier Science Ltd. (1985)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"J Blitzstein","year":"2011","unstructured":"Blitzstein, J., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489\u2013522 (2011)","journal-title":"Internet Math."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1(4), 311\u2013316 (1980)","journal-title":"Eur. J. Comb."},{"issue":"469","key":"9_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1198\/016214504000001303","volume":"100","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Diaconis, P., Holmes, S.P., Liu, J.S.: Sequential Monte Carlo methods for statistical analysis of tables. J. Am. Stat. Assoc. 100(469), 109\u2013120 (2005)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR8","unstructured":"Chodrow, P.S.: Configuration models of random hypergraphs. arXiv preprint arXiv:1902.09302 pp. 1\u201320 (2019)"},{"issue":"434","key":"9_CR9","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1080\/01621459.1996.10476956","volume":"91","author":"MK Cowles","year":"1996","unstructured":"Cowles, M.K., Carlin, B.P.: Markov chain Monte Carlo convergence diagnostics: a comparative review. J. Am. Stat. Assoc. 91(434), 883\u2013904 (1996)","journal-title":"J. Am. Stat. Assoc."},{"issue":"6","key":"9_CR10","doi-asserted-by":"publisher","first-page":"066122","DOI":"10.1103\/PhysRevE.65.066122","volume":"65","author":"SN Dorogovtsev","year":"2002","unstructured":"Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: Pseudofractal scale-free web. Phys. Rev. E 65(6), 066122 (2002)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<487::AID-RSA4>3.0.CO;2-Q","volume":"10","author":"M Dyer","year":"1997","unstructured":"Dyer, M., Kannan, R., Mount, J.: Sampling contingency tables. Random Struct. Algorithms 10(4), 487\u2013506 (1997)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/16M1087175","volume":"60","author":"BK Fosdick","year":"2018","unstructured":"Fosdick, B.K., Larremore, D.B., Nishimura, J., Ugander, J.: Configuring random graph models with fixed degree sequences. SIAM Rev. 60(2), 315\u2013355 (2018)","journal-title":"SIAM Rev."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"498","DOI":"10.4153\/CJM-1962-041-9","volume":"14","author":"DR Fulkerson","year":"1962","unstructured":"Fulkerson, D.R., Ryser, H.J.: Multiplicities and minimal widths for (0, 1)-matrices. Can. J. Math. 14, 498\u2013508 (1962)","journal-title":"Can. J. Math."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D Gale","year":"1957","unstructured":"Gale, D., et al.: A theorem on flows in networks. Pac. J. Math. 7(2), 1073\u20131082 (1957)","journal-title":"Pac. J. Math."},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U.U., Theis, F.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5(5), e1000385 (2009)","journal-title":"PLoS Comput. Biol."},{"key":"9_CR16","unstructured":"Kong, A.: A note on importance sampling using standardized weights. University of Chicago, Department of Statistics, Technical report 348 (1992)"},{"key":"9_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68276-1","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"AW Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of Majorization and Its Applications, vol. 143. Springer, New York (1979). https:\/\/doi.org\/10.1007\/978-0-387-68276-1"},{"key":"9_CR18","unstructured":"Milo, R., Kashtan, N., Itzkovitz, S., Newman, M.E., Alon, U.: On the uniform generation of random graphs with prescribed degree sequences. arXiv preprint cond-mat\/0312028 (2003)"},{"key":"9_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2018)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"H Ryser","year":"1957","unstructured":"Ryser, H.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371\u2013377 (1957)","journal-title":"Can. J. Math."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jnca.2016.10.002","volume":"86","author":"W Yang","year":"2016","unstructured":"Yang, W., Wang, G., Bhuiyan, M., Choo, K.: Hypergraph partitioning for social networks based on information entropy modularity. J. Netw. Comput. Appl. 86, 59\u201371 (2016)","journal-title":"J. Netw. Comput. Appl."},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s13278-013-0095-y","volume":"3","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Zheng, B.: Hypergraph index: an index for context-aware nearest neighbor query on social networks. Soc. Netw. Anal. Min. 3(4), 813\u2013828 (2013)","journal-title":"Soc. Netw. Anal. Min."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59051-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:37:01Z","timestamp":1709811421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59051-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590505","9783030590512"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59051-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"190","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online. DEXA Workshops volume: submissions sent - 15, full papers accepted - 6, short papers accepted - 4, reviewers per paper 3, papers per reviewer 1-2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}