{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:50:38Z","timestamp":1743000638106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534980"},{"type":"electronic","value":"9783031534997"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53499-7_33","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:03:01Z","timestamp":1709150581000},"page":"408-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniform Generation of\u00a0Temporal Graphs with\u00a0Given Degrees"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Allendorf","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/rsa.21004","volume":"59","author":"A Arman","year":"2021","unstructured":"Arman, A., Gao, P., Wormald, N.C.: Fast uniform generation of random graphs with given degree sequences. Random Struct. Algorithms 59(3), 291\u2013314 (2021)","journal-title":"Random Struct. Algorithms"},{"issue":"7039","key":"33_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barab\u00e1si","year":"2005","unstructured":"Barab\u00e1si, A.L.: The origin of bursts and heavy tails in human dynamics. Nature 435(7039), 207\u2013211 (2005)","journal-title":"Nature"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bender, E.A., Canfield, E.R.: The asymptotic number of labeled graphs with given degree sequences. J. Comb. Theory, Ser. A 24(3), 296\u2013307 (1978)","DOI":"10.1016\/0097-3165(78)90059-6"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"JK Blitzstein","year":"2011","unstructured":"Blitzstein, J.K., 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":"33_CR5","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":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125\u2013145 (2002)","journal-title":"Ann. Comb."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"103421","DOI":"10.1016\/j.ejc.2021.103421","volume":"99","author":"PL Erd\u00f6s","year":"2022","unstructured":"Erd\u00f6s, P.L., Greenhill, C.S., Mezei, T.R., Mikl\u00f3s, I., Solt\u00e9sz, D., Soukup, L.: The mixing time of switch Markov chains: a unified approach. Eur. J. Comb. 99, 103421 (2022)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/15M1052779","volume":"46","author":"P Gao","year":"2017","unstructured":"Gao, P., Wormald, N.C.: Uniform generation of random regular graphs. SIAM J. Comput. 46(4), 1395\u20131427 (2017)","journal-title":"SIAM J. Comput."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Gao, P., Wormald, N.C.: Uniform generation of random graphs with power-law degree sequences. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pp. 1741\u20131758. SIAM (2018)","DOI":"10.1137\/1.9781611975031.114"},{"key":"33_CR11","unstructured":"Gotelli, N.J., Graves, G.R.: Null Models in Ecology. Smithsonian Institution (1996)"},{"key":"33_CR12","first-page":"133","volume":"2021","author":"C Greenhill","year":"2021","unstructured":"Greenhill, C.: Generating graphs randomly. Surv. Comb. 2021, 133\u2013186 (2021)","journal-title":"Surv. Comb."},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.physa.2005.06.079","volume":"361","author":"U Harder","year":"2006","unstructured":"Harder, U., Paczuski, M.: Correlated dynamics in human printing behavior. Phys. A 361(1), 329\u2013336 (2006)","journal-title":"Phys. A"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(90)90164-D","volume":"73","author":"M Jerrum","year":"1990","unstructured":"Jerrum, M., Sinclair, A.: Fast uniform generation of regular graphs. Theor. Comput. Sci. 73(1), 91\u2013100 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"33_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0196-6774(90)90029-E","volume":"11","author":"BD McKay","year":"1990","unstructured":"McKay, B.D., Wormald, N.C.: Uniform generation of random regular graphs of moderate degree. J. Algorithms 11(1), 52\u201367 (1990)","journal-title":"J. Algorithms"},{"issue":"1","key":"33_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82(1), 93\u2013133 (1989)","journal-title":"Inf. Comput."},{"issue":"2","key":"33_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(84)90030-0","volume":"5","author":"NC Wormald","year":"1984","unstructured":"Wormald, N.C.: Generating random regular graphs. J. Algorithms 5(2), 247\u2013280 (1984)","journal-title":"J. Algorithms"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications XII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53499-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T20:09:39Z","timestamp":1709150979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53499-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534980","9783031534997"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53499-7_33","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","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":"Menton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2023","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"}}]}}