2 citations · 2 across the 1 of their papers we have counts for
1 paper
Peter J. Dukes, Jonathan A. Noel, Abel E. Romer
For r≥1, 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 b…