{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:15:32Z","timestamp":1743110132460,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934088"},{"type":"electronic","value":"9783030934095"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93409-5_38","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"451-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Limitations of\u00a0Chung Lu Random Graph Generation"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Brissette","sequence":"first","affiliation":[]},{"given":"George","family":"Slota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"38_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 2016: 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":"6","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","volume":"124","author":"T Britton","year":"2006","unstructured":"Britton, T., Deijfen, M., Martin-L\u00f6f, A.: Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124(6), 1377\u20131397 (2006). https:\/\/doi.org\/10.1007\/s10955-006-9168-x","journal-title":"J. Stat. Phys."},{"issue":"4","key":"38_CR3","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/19M1288772","volume":"2","author":"PS Chodrow","year":"2020","unstructured":"Chodrow, P.S.: Moments of uniform random multigraphs with fixed degree sequences. SIAM J. Math. Data Sci. 2(4), 1034\u20131065 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"25","key":"38_CR4","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. Natl. Acad. Sci. 99(25), 15879\u201315882 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"38_CR5","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"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s002110050360","volume":"80","author":"A Eisinberg","year":"1998","unstructured":"Eisinberg, A., Franz\u00e9, G., Pugliese, P.: Vandermonde matrices on integer nodes. Numer. Math. 80, 75\u201385 (1998). https:\/\/doi.org\/10.1007\/s002110050360","journal-title":"Numer. Math."},{"issue":"2","key":"38_CR7","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":"38_CR8","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"},{"issue":"4","key":"38_CR9","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1002\/rsa.20450","volume":"42","author":"R van der Hofstad","year":"2013","unstructured":"van der Hofstad, R.: Critical behavior in inhomogeneous random graphs. Random Struct. Algorithms 42(4), 480\u2013508 (2013)","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"38_CR10","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."},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-21286-4_10","volume-title":"Algorithms and Models for the Web Graph","author":"JC Miller","year":"2011","unstructured":"Miller, J.C., Hagberg, A.: Efficient generation of networks with given expected degrees. In: Frieze, A., Horn, P., Pra\u0142at, P. (eds.) WAW 2011. LNCS, vol. 6732, pp. 115\u2013126. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21286-4_10"},{"issue":"5594","key":"38_CR12","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"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Pfeiffer\u00a0III, J.J., La\u00a0Fond, T., Moreno, S., Neville, J.: Fast generation of large scale social networks with clustering. arXiv preprint arXiv:1202.4805 (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.130"},{"key":"38_CR14","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":"38_CR15","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":"38_CR16","doi-asserted-by":"crossref","unstructured":"Winlaw, M., DeSterck, H., Sanders, G.: An in-depth analysis of the Chung-Lu model. Technical report, Lawrence Livermore National Laboratory (LLNL), Livermore, CA, United States (2015)","DOI":"10.2172\/1239211"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93409-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:35:35Z","timestamp":1682627735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_38","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","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"}}]}}