3 papers
math.CO2019
Resolution of a conjecture on majority dynamics: rapid stabilisation in dense random graphs
Nikolaos Fountoulakis, Mihyun Kang, Tamás Makai
We study majority dynamics on the binomial random graph with and , for some large . In this process, each vertex has a state in a…
math.CO2019
The Size of the Giant Joint Component in a Binomial Random Double Graph
Mark Jerrum, Tamás Makai
We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on ~vertices. A joint component is a maximal set of…
math.CO2016
Bootstrap percolation on G(n,p) revisited
Mihyun Kang, Tamás Makai
Bootstrap percolation on a graph with infection threshold is an infection process, which starts from a set of initially infected vertices and in each step every v…