{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:12:32Z","timestamp":1747887152628,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031928970","type":"print"},{"value":"9783031928987","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92898-7_4","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:13:34Z","timestamp":1747833214000},"page":"45-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Size of\u00a0the\u00a0Giant in\u00a0Inhomogeneous Random Graphs of\u00a0Preferential Attachment Type"],"prefix":"10.1007","author":[{"given":"Peter","family":"M\u00f6rters","sequence":"first","affiliation":[]},{"given":"Lucas","family":"Sch\u00e4tze","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1090\/S0002-9947-1981-0621971-7","volume":"267","author":"B Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B.: The diameter of random graphs. Trans. Amer. Math. Soc. 267, 41\u201352 (1981)","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20041","volume":"26","author":"B Bollob\u00e1s","year":"2005","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in the uniformly grown random graph has infinite order. Random Struct. Alg. 26, 1\u201336 (2005)","journal-title":"Random Struct. Alg."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/rsa.20168","volume":"31","author":"B Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Alg. 31, 116\u2013123 (2007)","journal-title":"Random Struct. Alg."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, R., ben Avraham, D., Havlin, S.: Percolation critical exponents in scale-free networks. Phys. Rev. E. 66(036113) (2002)","DOI":"10.1103\/PhysRevE.66.036113"},{"key":"4_CR5","unstructured":"Combes, R.: An extension of McDiarmid\u2019s inequality. Preprint arXiv:1511.05240 (2015)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1239\/aap\/1339878725","volume":"44","author":"M Dereich","year":"2012","unstructured":"Dereich, M., M\u00f6nch, C., M\u00f6rters, P.: Typical distances in ultrasmall random networks. Adv. Appl. Probab. 44, 583\u2013601 (2012)","journal-title":"Adv. Appl. Probab."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1214\/11-AOP697","volume":"41","author":"S Dereich","year":"2013","unstructured":"Dereich, S., M\u00f6rters, P.: Random networks with sublinear preferential attachment: the giant component. Ann. Probab. 41, 329\u2013384 (2013)","journal-title":"Ann. Probab."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10955-018-2054-5","volume":"173","author":"M Eckhoff","year":"2018","unstructured":"Eckhoff, M., M\u00f6rters, P., Ortgiese, M.: Near critical preferential attachment networks have small giant components. J. Stat. Phys. 173, 663\u2013703 (2018)","journal-title":"J. Stat. Phys."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"van\u00a0der Hofstad, R.: Random Graphs and Complex Networks. Volume Two. Cambridge Series in Statistical and Probabilistic Mathematics (2024)","DOI":"10.1017\/9781316795552"},{"key":"4_CR10","unstructured":"Leifhelm, F.: Inhomogeneous random graphs of preferential attachment type: the size of the giant component near criticality. Master thesis, University of Cologne (2024)"},{"key":"4_CR11","unstructured":"M\u00f6nch, C.: Distances in preferential attachment networks. Ph.D. thesis, University of Bath (2012)"},{"key":"4_CR12","first-page":"1767","volume":"6","author":"P M\u00f6rters","year":"2023","unstructured":"M\u00f6rters, P.: Tangent graphs. Pure Appl. Funct. Anal. 6, 1767\u20131779 (2023)","journal-title":"Pure Appl. Funct. Anal."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1017\/S096354830500708X","volume":"14","author":"O Riordan","year":"2005","unstructured":"Riordan, O.: The small giant component in scale-free random graphs. Comb. Probab. Comput. 14, 897\u2013938 (2005)","journal-title":"Comb. Probab. Comput."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"S\u00f6derberg, B.: A general formalism for inhomogeneous random graphs. Phys. Rev.\u00a0E 66(066121) (2002)","DOI":"10.1103\/PhysRevE.66.066121"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92898-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:13:40Z","timestamp":1747833220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92898-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031928970","9783031928987"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92898-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have\u00a0no competing interests to declare that are relevant to the content\u00a0of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interes"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Modelling and Mining Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}