10 citations · 41 across the 19 of their papers we have counts for
31 papers
Partitioning problems via random processes
Michael Anastos, Oliver Cooley, Mihyun Kang +1
There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, S…
The emergence of a giant rainbow component
Oliver Cooley, Tuan Anh Do, Joshua Erde +1
The random coloured graph is obtained from the Erdős-Rényi binomial random graph by assigning to each edge a colour from a set of colours independently and…
High-order bootstrap percolation in hypergraphs
Oliver Cooley, Julian Zalla
Motivated by the bootstrap percolation process for graphs, we define a new, high-order generalisation to -uniform hypergraphs, in which we infect -sets of vertices for some i…
Warning Propagation: stability and subcriticality
Oliver Cooley, Joon Lee, Jean B. Ravelomanana
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit C…
The sparse parity matrix
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +2
Let be an -matrix over whose every entry equals with probability independently for a fixed . Draw a vector random…
Paths, cycles and sprinkling in random hypergraphs
Oliver Cooley
We prove a lower bound on the length of the longest -tight cycle in a -uniform binomial random hypergraph for any . We first prove the existence of a -tig…