35 citations · 48 across the 3 of their papers we have counts for
3 papers
The sharp threshold for jigsaw percolation in random graphs
Oliver Cooley, Tobias Kapetanopoulos, Tamás Makai
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…
The replica symmetric phase of random constraint satisfaction problems
Amin Coja-Oghlan, Tobias Kapetanopoulos, Noela Müller
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and t…
Charting the replica symmetric phase
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari +2
Diluted mean-field models are spin systems whose geometry of interactions is induced by a sparse random graph or hypergraph. Such models play an eminent role in the statistical mec…