The PIMS Postdoctoral Fellow Seminar: 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'). The goal of the player is to construct a small fixed graph G as a subgraph of the semi-random graph in as few steps as possible. I will discuss this process, and in particular the asympotically tight bounds we have found on how many steps the player needs to win. This is joint work with Trent Marbach, Pawel Pralat and Andrzej Rucinski.

Speaker Biography: Natalie completed her PhD in 2020 at Queen Mary University of London under the supervision of Robert Johnson. Prior to this, she completed both her Bachelors and Masters degrees at the University of Cambridge. After finishing her PhD she spent a year at the University of Ryerson in Toronto with the Graphs at Ryerson research group. She has worked on various problems under the broad umbrella of probabilistic and extremal combinatorics, including automata, graph saturation, graph factorization and probabilistic zero-forcing (a model for infection or rumour spreading across networks). Since the start of 2022 she has been a postdoctoral fellow at the University of Victoria, working with Natasha Morrison and Jonathan Noel.

Read more about our PIMS PDFs on our Medium feature here.  

This event is part of the Emergent Research: The PIMS Postdoctoral Fellow Colloquium Series.