random graphs and algorithms

when you want to know what to expect

This research area studies properties of random graphs and related structures, and evaluates random processes, such as Markov chains. This informs on typical properties of graph families, and running time analyses of randomized algorithms.

selected papers

  1. Anita Liebenau, and Nick Wormald
    Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
    Journal of the European Mathematical Society, 2024
  2. SODA
    The switch Markov chain for sampling irregular graphs (Extended Abstract)
    In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, 2015
  3. Martin E. Dyer, Alan M. Frieze, and Catherine S. Greenhill
    On the chromatic number of a random hypergraph
    Journal of Combinatorial Theory, Series B, 2015