{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:26:05Z","timestamp":1743089165370,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_29","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"399-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shifting the Phase Transition Threshold for Random Graphs Using Degree Set\u00a0Constraints"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Dovgal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlady","family":"Ravelomanana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/rsa.1019","volume":"19","author":"T Bohman","year":"2001","unstructured":"Bohman, T., Freize, A.: Avoiding a giant component. Random Struct. Algorithms 19(1), 75\u201385 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"29_CR2","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, 311\u2013316 (1980)","journal-title":"Eur. J. Comb."},{"key":"29_CR3","unstructured":"de Panafieu, \u00c9., Ramos, L.: Enumeration of graphs with degree constraints. In: Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (2016)"},{"key":"29_CR4","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 5, 17\u201361 (1960)","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P Flajolet","year":"1982","unstructured":"Flajolet, P., Odlyzko, A.M.: The average height of binary trees and other simple trees. J. Comput. Syst. Sci. 25, 171\u2013213 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge Press, Cambridge (2009)"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/rsa.20394","volume":"41","author":"H Hatami","year":"2012","unstructured":"Hatami, H., Molloy, M.: The scaling window for a random graph with a given degree sequence. Random Struct. Algorithms 41(1), 99\u2013123 (2012)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/rsa.3240040303","volume":"4","author":"S Janson","year":"1993","unstructured":"Janson, S., Knuth, D.E., \u0141uczak, T., Pittel, B.: The birth of the giant component. Random Struct. Algorithms 4(3), 231\u2013358 (1993)","journal-title":"Random Struct. Algorithms"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Joos, F., Perarnau, G., Rautenbach, D., Reed, B.: How to determine if a random graph with a fixed degree sequence has a giant component. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 695\u2013703 (2016)","DOI":"10.1109\/FOCS.2016.79"},{"key":"29_CR10","unstructured":"Liebenau, A., Wormald, N.: Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph. arXiv preprint arXiv:1702.08373 (2017)"},{"issue":"2\/3","key":"29_CR11","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.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2\/3), 161\u2013180 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1214\/07-AOP358","volume":"36","author":"A Nachmias","year":"2008","unstructured":"Nachmias, A., Peres, Y.: Critical random graphs: diameter and mixing time. Ann. Probab. 36(4), 1267\u20131286 (2008)","journal-title":"Ann. Probab."},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1090\/S0002-9939-2014-12141-1","volume":"143","author":"M Noy","year":"2015","unstructured":"Noy, M., Ravelomanana, V., Ru\u00e9, J.: On the probability of planarity of a random graph near the critical point. Proc. Am. Math. Soc. 143(3), 925\u2013936 (2015)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20132","key":"29_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0963548311000666","volume":"21","author":"O Riordan","year":"2012","unstructured":"Riordan, O.: The phase transition in the configuration model. Comb. Probab. Comput. 21(1\u20132), 265\u2013299 (2012)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1214\/11-AAP798","volume":"22","author":"O Riordan","year":"2012","unstructured":"Riordan, O., Warnke, L.: Achlioptas process phase transitions are continuous. Ann. Appl. Probab. 22(4), 1450\u20131464 (2012)","journal-title":"Ann. Appl. Probab."},{"key":"29_CR16","unstructured":"Riordan, O., Warnke, L.: The phase transition in bounded-size Achlioptas processes. arXiv preprint arXiv:1704.08714 (2017)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:03:08Z","timestamp":1709827388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}