Linear algebra and bootstrap percolation
In $\HH$-bootstrap percolation, a set $A \subset V(\HH)$ of initially 'infected' vertices spreads by infecting vertices which are the only uninfected vertex in an edge of the hypergraph $\HH$. A particular case of this is the $H$-bootstrap process, in which $\HH$ encodes copies of $H$ in a...
Main Authors: | Balogh, J, Bollobás, B, Morris, R, Riordan, O |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2011
|
Similar Items
-
On the maximum running time in graph bootstrap percolation
by: Bollobás, B, et al.
Published: (2017) -
Percolation.
by: Bollobás, B, et al.
Published: (2006) -
Clique percolation
by: Bollobas, B, et al.
Published: (2008) -
Sharp thresholds and percolation in the plane
by: Bollobas, B, et al.
Published: (2004) -
Line-of-sight percolation
by: Bollobas, B, et al.
Published: (2007)