{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T05:45:29Z","timestamp":1782625529654,"version":"3.54.5"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T00:00:00Z","timestamp":1276041600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p>We study the \u2018rank 1 case\u2019 of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log<jats:italic>n<\/jats:italic>. This result complements the corresponding known result in the supercritical case. We provide some examples of applications of the derived formula.<\/jats:p>","DOI":"10.1017\/s0963548310000180","type":"journal-article","created":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T08:25:38Z","timestamp":1276071938000},"page":"131-154","source":"Crossref","is-referenced-by-count":10,"title":["The Largest Component in Subcritical Inhomogeneous Random Graphs"],"prefix":"10.1017","volume":"20","author":[{"given":"TATYANA S.","family":"TUROVA","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2010,6,9]]},"reference":[{"key":"S0963548310000180_ref5","doi-asserted-by":"publisher","DOI":"10.1137\/050630106"},{"key":"S0963548310000180_ref10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/rsa.20287","article-title":"Merging percolation on Zd and classical random graphs: Phase transition","volume":"36","author":"Turova","journal-title":"Random Struct. Alg."},{"key":"S0963548310000180_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021035131946"},{"key":"S0963548310000180_ref7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010106"},{"key":"S0963548310000180_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03981-6"},{"key":"S0963548310000180_ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20168"},{"key":"S0963548310000180_ref4","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"S0963548310000180_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(51)50054-9"},{"key":"S0963548310000180_ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730031"},{"key":"S0963548310000180_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-006-9168-x"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548310000180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T12:04:48Z","timestamp":1711541088000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548310000180\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,9]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["S0963548310000180"],"URL":"https:\/\/doi.org\/10.1017\/s0963548310000180","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,9]]}}}