Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Romer, Abel E."'
For $r\geq1$, the $r$-neighbour bootstrap process in a graph $G$ starts with a set of infected vertices and, in each time step, every vertex with at least $r$ infected neighbours becomes infected. The initial infection percolates if every vertex of $
Externí odkaz:
http://arxiv.org/abs/2209.07594
