TY - JOUR
T1 - The sharp threshold for jigsaw percolation in random graphs
AU - Cooley, O.
AU - Kapetanopoulos, T.
AU - Makai, T.
PY - 2019
Y1 - 2019
N2 - We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are ‘jointly connected’. Bollobás, Riordan, Slivken, and Smith (2017) proved that, when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is . We show that this threshold is sharp, and that it lies at
AB - We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are ‘jointly connected’. Bollobás, Riordan, Slivken, and Smith (2017) proved that, when the two graphs are independent binomial random graphs, whether the jigsaw process percolates undergoes a phase transition when the product of the two probabilities is . We show that this threshold is sharp, and that it lies at
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85070481267&partnerID=MN8TOARS
U2 - 10.1017/apr.2019.24
DO - 10.1017/apr.2019.24
M3 - Article
VL - 51
SP - 378
EP - 407
JO - Advances in Applied Probability
JF - Advances in Applied Probability
SN - 0001-8678
IS - 2
ER -