2 citations · 12 across the 19 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.PR2026
The critical activation density in graph bootstrap percolation
Brett Kolesnik, Tamás Makai, Rajko Nenadov +3
In graph bootstrap percolation, edges of an Erdős-Rényi random graph are initially active, and activation spreads to other edges of via the combinatorics…
math.CO2026
Canonical labelling of random regular graphs
Mikhail Isaev, Tamás Makai, Brendan McKay +3
We prove that whenever and as , then with high probability for any non-trivial initial colouring, the colour refinement algorithm disti…