Minimal percolating sets in bootstrap percolation (Q1010903): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0702370 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:36, 18 April 2024

scientific article
Language Label Description Also known as
English
Minimal percolating sets in bootstrap percolation
scientific article

    Statements

    Minimal percolating sets in bootstrap percolation (English)
    0 references
    0 references
    7 April 2009
    0 references
    Summary: In standard bootstrap percolation, a subset \(A\) of the grid \([n]^2\) is initially infected. A new site is then infected if at least two of its neighbours are infected, and an infected site stays infected forever. The set \(A\) is said to percolate if eventually the entire grid is infected. A percolating set is said to be minimal if none of its subsets percolate. Answering a question of Bollobás, we show that there exists a minimal percolating set of size \(4n^2/33 + o(n^2)\), but there does not exist one larger than \((n + 2)^2/6\).
    0 references

    Identifiers