{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:13Z","timestamp":1753893793514,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is inspired by a simple propagation algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for the propagation connectivity threshold. Our proof is based on a kind of large deviations analysis of a time-dependent random walk. Based on the analysis, we also give an upper bound on the expected running time of the simple propagation algorithm.<\/jats:p>","DOI":"10.37236\/1168","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:33:51Z","timestamp":1578713631000},"source":"Crossref","is-referenced-by-count":2,"title":["Propagation Connectivity of Random Hypergraphs"],"prefix":"10.37236","volume":"19","author":[{"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[]},{"given":"Mikael","family":"Onsj\u00f6","sequence":"additional","affiliation":[]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2012,1,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i1p17\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i1p17\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:57:10Z","timestamp":1579301830000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i1p17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2012,2,15]]}},"URL":"https:\/\/doi.org\/10.37236\/1168","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2012,1,16]]},"article-number":"P17"}}