{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:40:04Z","timestamp":1787323204654,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>We investigate the threshold probability for connectivity of sparse graphs under weak assumptions. As a corollary this completely solves the problem for Cartesian powers of arbitrary graphs. In detail, let $G$ be a connected graph on $k$ vertices, $G^n$ be the $n$th Cartesian power of $G$, $\\alpha_i$ be the number of vertices of degree $i$ of $G$, $\\lambda$ be a positive real number, and $G^n_p$ be the graph obtained from $G^n$ by deleting every edge independently with probability $1-p$. If $\\sum_{i} \\alpha_i(1-p)^i=\\lambda^{\\frac{1}{n}}$, then $\\lim_{n\\rightarrow \\infty}\\mathbb{P}[G^n_p {\\rm\\ is\\ connected}]=\\exp(-\\lambda)$. This result extends known results for regular graphs. The main result implies that the threshold probability does not depend on the graph structure of $G$ itself, but only on the degree sequence of the graph.<\/jats:p>","DOI":"10.1137\/140976340","type":"journal-article","created":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T21:50:41Z","timestamp":1449179441000},"page":"2350-2360","source":"Crossref","is-referenced-by-count":2,"title":["Random Subgraphs in Sparse Graphs"],"prefix":"10.1137","volume":"29","author":[{"given":"Felix","family":"Joos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,12,3]]},"reference":[{"key":"atypb1","unstructured":"N. Alon and J. H. Spencer,\n                      The Probabilistic Method\n                      , 3rd ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc, Hoboken, NJ, 2008."},{"key":"atypb2","unstructured":"B. Bolloba\u0301s,\n                      Random Graphs\n                      , 2nd ed., Cambridge Stud. Adv. Math. 73. Cambridge University Press, Cambridge, 2001."},{"key":"atypb3","first-page":"91","author":"Bolloba\u0301s B.","year":"1983","journal-title":"Amsterdam"},{"key":"atypb4","first-page":"90","volume":"13","author":"Burtin J. D.","year":"1977","journal-title":"Problemy Peredac\u030ci Informacii"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1155\/S0161171202201210"},{"key":"atypb6","unstructured":"R. Durrett,\n                      Probability: Theory and Examples\n                      , The Wadsworth & Brooks\/Cole Statistics\/Probability Series, Wadsworth & Brooks\/Cole Advanced Books & Software, Pacific Grove, CA, 1991."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90137-1"},{"key":"atypb9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.37236\/2058","volume":"19","author":"Joos F.","year":"2012","journal-title":"Electron. J. Combin."},{"key":"atypb10","unstructured":"R. van der Hofstad and A. Nachmias,\n                      Hypercube percolation\n                      , preprint, arXiv:1201.3953v1, 2012; J. Eur. Math. Soc., to appear."},{"key":"atypb11","first-page":"105","author":"Pala\u0301sti I.","year":"1968","journal-title":"Budapest"},{"key":"atypb12","first-page":"321","volume":"29","author":"Rucin\u0301ski A.","year":"1981","journal-title":"Bull. Acad. Polon. Sci. Se\u0301r. Sci. Math."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00189-2"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140976340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:47:56Z","timestamp":1787320076000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140976340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140976340"],"URL":"https:\/\/doi.org\/10.1137\/140976340","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}