5 citations · 8 across the 3 of their papers we have counts for
5 papers
Burning the plane: densities of the infinite Cartesian grid
Anthony Bonato, Karen Gunderson, Amy Shaw
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal prope…
Minimum degree conditions for small percolating sets in bootstrap percolation
Karen Gunderson
The -neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least `infected' neighbours become infected and a set of…
A sharp threshold for a modified bootstrap percolation with recovery
Tom Coker, Karen Gunderson
Bootstrap percolation is a type of cellular automaton on graphs, introduced as a simple model of the dynamics of ferromagnetism. Vertices in a graph can be in one of two states: `h…
Random Geometric Graphs and Isometries of Normed Spaces
Paul Balister, Béla Bollobás, Karen Gunderson +2
Given a countable dense subset of a finite-dimensional normed space , and , we form a random graph on by joining, independently and with probability , each pai…
Bootstrap percolation on Galton-Watson trees
Béla Bollobás, Karen Gunderson, Cecilia Holmgren +2
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number , the -neighbou…