{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:42Z","timestamp":1725524622664},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540959946"},{"type":"electronic","value":"9783540959953"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95995-3_4","type":"book-chapter","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T02:33:44Z","timestamp":1233196424000},"page":"38-49","source":"Crossref","is-referenced-by-count":6,"title":["The Giant Component in a Random Subgraph of a Given Graph"],"prefix":"10.1007","author":[{"given":"Fan","family":"Chung","sequence":"first","affiliation":[]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[]},{"given":"Linyuan","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"crossref","first-page":"1727","DOI":"10.1214\/009117904000000414","volume":"32","author":"N. Alon","year":"2004","unstructured":"Alon, N., Benjamini, I., Stacey, A.: Percolation on finite graphs and isoperimetric inequalities. Annals of Probability\u00a032(3), 1727\u20131745 (2004)","journal-title":"Annals of Probability"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579276","volume":"2","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Largest random component of a k-cube. Combinatorica\u00a02, 1\u20137 (1982)","journal-title":"Combinatorica"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/rsa.3240030106","volume":"3","author":"B. Bollobas","year":"1992","unstructured":"Bollobas, B., Kohayakawa, Y., \u0141uczak, T.: The evolution of random subgraphs of the cube. Random Structures and Algorithms\u00a03(1), 55\u201390 (1992)","journal-title":"Random Structures and Algorithms"},{"key":"4_CR4","unstructured":"Bollobas, B., Borgs, C., Chayes, J., Riordan, O.: Percolation on dense graph sequences (preprint)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/rsa.20051","volume":"27","author":"C. Borgs","year":"2005","unstructured":"Borgs, C., Chayes, J., van der Hofstad, R., Slade, G., Spencer, J.: Random subgraphs of finite graphs. I. The scaling window under the triangle condition. Random Structures and Algorithms\u00a027(2), 137\u2013184 (2005)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00493-006-0022-1","volume":"26","author":"C. Borgs","year":"2006","unstructured":"Borgs, C., Chayes, J., van der Hofstad, R., Slade, G., Spencer, J.: Random subgraphs of finite graphs. III. The scaling window under the triangle condition. Combinatorica\u00a026(4), 395\u2013410 (2006)","journal-title":"Combinatorica"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chung, F.: Spectral Graph Theory. AMS Publications (1997)","DOI":"10.1090\/cbms\/092"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2004.10129089","volume":"1","author":"F. Chung","year":"2004","unstructured":"Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Mathematics\u00a01, 257\u2013275 (2004)","journal-title":"Internet Mathematics"},{"key":"4_CR9","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. Annals of Combinatorics\u00a06, 125\u2013145 (2002)","journal-title":"Annals of Combinatorics"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Complex Graphs and Networks. AMS Publications (2006)","DOI":"10.1090\/cbms\/107"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On Random Graphs I. Publ. Math Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math Debrecen"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/rsa.10100","volume":"24","author":"A. Frieze","year":"2004","unstructured":"Frieze, A., Krivelevich, M., Martin, R.: The emergence of a giant component of pseudo-random graphs. Random Structures and Algorithms\u00a024, 42\u201350 (2004)","journal-title":"Random Structures and Algorithms"},{"key":"4_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4208-4","volume-title":"Percolation","author":"G. Grimmett","year":"1989","unstructured":"Grimmett, G.: Percolation. Springer, New York (1989)"},{"key":"4_CR14","volume-title":"Progress in Probability and Statistics","author":"H. Kesten","year":"1982","unstructured":"Kesten, H.: Percolation theory for mathematicians. In: Progress in Probability and Statistics, vol.\u00a02, Birkh\u00e4user, Boston (1982)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45726-7_8","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"C. Malon","year":"2002","unstructured":"Malon, C., Pak, I.: Percolation on finite cayley graphs. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 91\u2013104. Springer, Heidelberg (2002)"},{"key":"4_CR16","unstructured":"Nachmias, A.: Mean-field conditions for percolation in finite graphs (preprint, 2007)"},{"key":"4_CR17","unstructured":"Nachmias, A., Peres, Y.: Critical percolation on random regular graphs (preprint, 2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95995-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T16:04:37Z","timestamp":1684857877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95995-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540959946","9783540959953"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95995-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}