{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:59:03Z","timestamp":1743155943081,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211300"},{"type":"electronic","value":"9783031211317"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21131-7_6","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:15Z","timestamp":1674669855000},"page":"69-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Correcting Output Degree Sequences in\u00a0Chung-Lu Random Graph Generation"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Brissette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George M.","family":"Slota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M., Khan, M., Vullikanti, A., Marathe, M.: An efficient and scalable algorithmic method for generating large-scale random graphs. In: SC\u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. pp. 372\u2013383. IEEE (2016)","DOI":"10.1109\/SC.2016.31"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"6_CR3","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. Euro. J. Combin. 1(4), 311\u2013316 (1980)","journal-title":"Euro. J. Combin."},{"key":"6_CR4","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: Numerical Optimization: Theoretical and Practical Aspects. Springer Science & Business Media (2006)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Brissette, C., Slota, G.M.: Limitations of Chung Lu random graph generation. In: International Conference on Complex Networks and Their Applications. pp. 451\u2013462. Springer (2021)","DOI":"10.1007\/978-3-030-93409-5_38"},{"issue":"25","key":"6_CR6","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Nat. Acad. Sci. 99(25), 15879\u201315882 (2002)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3369782","volume":"52","author":"M Drobyshevskiy","year":"2019","unstructured":"Drobyshevskiy, M., Turdakov, D.: Random graph modeling: a survey of the concepts. ACM Comput. Surveys (CSUR) 52(6), 1\u201336 (2019)","journal-title":"ACM Comput. Surveys (CSUR)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Durak, N., Kolda, T.G., Pinar, A., Seshadhri, C.: A scalable null model for directed graphs matching all degree distributions: in, out, and reciprocal. In: 2013 IEEE 2nd Network Science Workshop (NSW). pp. 23\u201330. IEEE (2013)","DOI":"10.1109\/NSW.2013.6609190"},{"issue":"2","key":"6_CR9","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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Garbus, J., Brissette, C., Slota, G.M.: Parallel generation of simple null graph models. In: The 5th IEEE Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial) (2020)","DOI":"10.1109\/IPDPSW50202.2020.00181"},{"key":"6_CR11","unstructured":"Hagberg, A., Swart, P., S\u00a0Chult, D.: Exploring network structure, dynamics, and function using network. Tech. rep., Los Alamos National Lab. (LANL), Los Alamos, NM (United States) (2008)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109\u2013137 (1983)","journal-title":"Soc. Netw."},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"C424","DOI":"10.1137\/130914218","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C.: A scalable generative graph model with community structure. SIAM J. Sci. Comput. 36(5), C424\u2013C452 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5594","key":"6_CR14","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"2\u20133","key":"6_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2\u20133), 161\u2013180 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"23","key":"6_CR16","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Berry, J., Hammond, S.D., Olivier, S., Phillips, C., Rajamanickam, S.: Scalable generation of graphs for benchmarking HPC community-detection algorithms. In: IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC) (2019)","DOI":"10.1145\/3295500.3356206"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Garbus, J.: A parallel LFR-like benchmark for evaluating community detection algorithms. In: The 5th IEEE Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial) (2020)","DOI":"10.1109\/IPDPSW50202.2020.00183"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Winlaw, M., DeSterck, H., Sanders, G.: An in-depth analysis of the Chung-Lu model. Tech. rep., Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States) (2015)","DOI":"10.2172\/1239211"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Meira\u00a0Jr, W., Meira, W.: Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press (2014)","DOI":"10.1017\/CBO9780511810114"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21131-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:51Z","timestamp":1674669891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21131-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211300","9783031211317"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21131-7_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}