35 citations · 48 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2018★ 2 cited
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…
math.CO2018★ 11 cited
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…