Natalie Behague

The semi-random graph process can be thought of as a one player game. Starting with an empty graph on n vertices, in each round a random vertex u is presented to the player, who chooses a vertex v and adds the edge uv to the graph (hence 'semi-random...

Probabilistic zero-forcing can be thought of as a model for rumour spreading, where a person is more likely to spread a rumour if several of their friends already believe it. We start with a graph that has one infected vertex. At each time step an...