The sharp threshold for jigsaw percolation in random graphs

O. Cooley, T. Kapetanopoulos, T. Makai

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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
Original languageEnglish
Pages (from-to)378-407
JournalAdvances in Applied Probability
Volume51
Issue number2
DOIs
Publication statusPublished - 2019

Fingerprint

Sharp Threshold
Random Graphs
Phase transitions
Graph in graph theory
Phase Transition
Vertex of a graph

Cite this

The sharp threshold for jigsaw percolation in random graphs. / Cooley, O.; Kapetanopoulos, T.; Makai, T.

In: Advances in Applied Probability, Vol. 51, No. 2, 2019, p. 378-407.

Research output: Contribution to journalArticleResearchpeer-review

Cooley, O. ; Kapetanopoulos, T. ; Makai, T. / The sharp threshold for jigsaw percolation in random graphs. In: Advances in Applied Probability. 2019 ; Vol. 51, No. 2. pp. 378-407.
@article{76149f9f0514491fad572214afc30393,
title = "The sharp threshold for jigsaw percolation in random graphs",
abstract = "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{\'a}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",
author = "O. Cooley and T. Kapetanopoulos and T. Makai",
year = "2019",
doi = "10.1017/apr.2019.24",
language = "English",
volume = "51",
pages = "378--407",
journal = "Advances in Applied Probability",
issn = "0001-8678",
publisher = "Cambridge University Press",
number = "2",

}

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 -