The sharp threshold for jigsaw percolation in random graphs

O. Cooley, T. Kapetanopoulos, T. Makai

Publikation: Beitrag in einer FachzeitschriftArtikel

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
Originalspracheenglisch
Seiten (von - bis)378-407
FachzeitschriftAdvances in Applied Probability
Jahrgang51
Ausgabenummer2
DOIs
PublikationsstatusVeröffentlicht - 2019

Fingerprint Untersuchen Sie die Forschungsthemen von „The sharp threshold for jigsaw percolation in random graphs“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren