Graph Theory Seminar - Alessandra Graf

Title: Percolation on random digraphs

Abstract: Percolation models are used to analyze the behaviour of systems which drastically change at some natural parameter or threshold. A classic example of such a behaviour is the presence of a giant component in a random graph. The presence of a giant strongly connected component in a random digraph behaves similarly. In this talk, we will discuss some results on the size of the largest strongly connected component in a random digraph before and after percolation.

Joint work with Jane Gao.