4 citations · 16 across the 17 of their papers we have counts for
6 papers · 1 filter
Explosive appearance of cores and bootstrap percolation on lattices
Ivailo Hartarsky, Lyuben Lichev
Consider the process where the vertices of a square -dimensional torus appear consecutively in a random order. We show that typically the size of the -core of the corresp…
Local dimer dynamics in higher dimensions
Ivailo Hartarsky, Lyuben Lichev, Fabio Toninelli
We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes . These consist of successively switching the dimers along alternating cycles of prescr…
The maximal running time of hypergraph bootstrap percolation
Ivailo Hartarsky, Lyuben Lichev
We show that for every , the maximal running time of the -bootstrap percolation in the complete -uniform hypergraph on vertices is . Thi…
Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness
Ivailo Hartarsky, Tamás Róbert Mezei
Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three rough universality classes, the most studie…
Strong Ramsey Games in Unbounded Time
Stefan David, Ivailo Hartarsky, Marius Tiba
For two graphs and the strong Ramsey game on the board and with target is played as follows. Two players alternately claim edges of . The firs…
Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box
Ivailo Hartarsky
In -neighbour bootstrap percolation, vertices (sites) of a graph are infected, round-by-round, if they have neighbours already infected. Once infected, they remain infec…