{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:04:31Z","timestamp":1725563071201},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_37","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"490-503","source":"Crossref","is-referenced-by-count":2,"title":["Propagation Connectivity of Random Hypergraphs"],"prefix":"10.1007","author":[{"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Onsj\u00f6","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-74208-1_25","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Behrisch","year":"2007","unstructured":"Behrisch, M., Coja-Oghlan, A., Kang, M.: Local limit theorems for the giant component of random hypergraphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 341\u2013352. Springer, Heidelberg (2007)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-04944-6_10","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"R. Berke","year":"2009","unstructured":"Berke, R., Onsj\u00f6, M.: Propagation connectivity of random hyptergraphs. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol.\u00a05792, pp. 117\u2013126. Springer, Heidelberg (2009)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1002\/rsa.20160","volume":"31","author":"A. Coja-Oghlan","year":"2007","unstructured":"Coja-Oghlan, A., Moore, C., Sanwalani, V.: Counting connected graphs and hypergraphs via the probabilistic method. Random Structure and Algorithms\u00a031, 288\u2013329 (2007)","journal-title":"Random Structure and Algorithms"},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/FOCS.2004.66","volume-title":"Proc. 45th Annual Symposium on Foundations of Computer Science (FOCS 2004)","author":"H. Connamacher","year":"2004","unstructured":"Connamacher, H., Molloy, M.: The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem. In: Proc. 45th Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 590\u2013599. IEEE, Los Alamitos (2004)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Onsj\u00f6, M., Watanabe, O.: Propagation connectivity of random hypergraphs, Research Report C-271, Dept. Math. Comput. Sci., Tokyo Inst. of Tech. (2010)","DOI":"10.1007\/978-3-642-15369-3_37"},{"key":"37_CR6","unstructured":"Durrett, R.: Probability and examples, 3rd edn. (2005)"},{"issue":"1A","key":"37_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1214\/105051604000000567","volume":"15","author":"R.W.R. Darling","year":"2005","unstructured":"Darling, R.W.R., Norris, J.R.: Structure of large random hypergraphs. Ann. App. Probability\u00a015(1A), 125\u2013152 (2005)","journal-title":"Ann. App. Probability"},{"key":"37_CR8","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1950","unstructured":"Feller, W.: An introduction to probability theory and its applications. Wiley, Chichester (1950)"},{"key":"37_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, Chichester (2000)"},{"key":"37_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing, Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing, Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, Cambridge (2005)"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/rsa.3240010106","volume":"1","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M.: The transitive closure of a random digraph. Random Structures and Algorithms\u00a01, 73\u201393 (1990)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/rsa.20061","volume":"27","author":"M. Molloy","year":"2005","unstructured":"Molloy, M.: Cores in random hypergraphs and Boolean formulas. Random Structures and Algorithms\u00a027(1), 124\u2013135 (2005)","journal-title":"Random Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:28Z","timestamp":1606187128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}