David Richerby is a postdoctoral researcher in the algorithms group in the University of Oxford Department of Computer Science. His main research interest is the complexity of counting problems, including weighted and unweighted versions of the constraint satisfaction problem, homomorphism problems and variants of these. He is also interested in stochastic processes on graphs, especially the Moran process, which models the spread of genetic mutations through populations.