Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness
Hartarsky, Ivailo; Mezei, Tamás Róbert (2020), Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness, SIAM Journal on Discrete Mathematics, 34, 2, p. 1444-1459. 10.1137/19M1239933
TypeArticle accepté pour publication ou publié
Nom de la revueSIAM Journal on Discrete Mathematics
MétadonnéesAfficher la notice complète
CEntre de REcherches en MAthématiques de la DEcision [CEREMADE]
Département de Mathématiques et Applications - ENS Paris [DMA]
Mezei, Tamás Róbert
Alfréd Rényi Institute of Mathematics
Résumé (EN)Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three rough universality classes, the most studied being the "critical" one. For this class the scaling of the quantity of greatest interest (the critical probability) was determined by Bollobás, Duminil-Copin, Morris and Smith in terms of a simply defined combinatorial quantity called "difficulty", so the subject seemed closed up to finding sharper results. However, the computation of the difficulty was never considered. In this paper we provide the first algorithm to determine this quantity, which is, surprisingly, not as easy as the definition leads to thinking. The proof also provides some explicit upper bounds, which are of use for bootstrap percolation. On the other hand, we also prove the negative result that computing the difficulty of a critical model is NP-hard. This two-dimensional picture contrasts with an upcoming result of Balister, Bollobás, Morris and Smith on uncomputability in higher dimensions. The proof of NP-hardness is achieved by a technical reduction to the Set Cover problem.
Mots-clésdecidable; bootstrap percolation; critical models; difficulty; complexity; NP-hard
Affichage des éléments liés par titre et auteur.
Two-dimensional Keller-Segel model: Optimal critical mass and qualitative properties of the solutions Blanchet, Adrien; Dolbeault, Jean; Perthame, Benoît (2006) Article accepté pour publication ou publié