Regular biography
Catherine S. Greenhill is a prominent mathematician and computer scientist known for her work in combinatorics, graph theory, and algorithm design. She has made significant contributions to the study of random graphs, Markov chain Monte Carlo methods, and the enumeration of combinatorial structures. Her research often intersects with applications in network science, including the analysis of criminal networks and social networks. Greenhill has held academic positions at institutions such as the University of Melbourne, the University of Oxford, and the University of Sydney. She is also recognized for her work on the switch Markov chain for sampling irregular graphs and digraphs, as well as her research on the chromatic number of random hypergraphs. Her work has been published in top-tier journals such as the *Journal of Combinatorial Theory Series B*, *SIAM Journal on Discrete Mathematics*, and *Electronic Journal of Combinatorics*.
Scholar-generated biography
Catherine Greenhill is a researcher in the fields of random structures, asymptotic enumeration, and randomized algorithms. Her work focuses on the complexity of counting problems, such as graph homomorphisms, colorings, and independent sets, often in sparse graphs and hypergraphs. She has also explored the use of Markov chains for sampling combinatorial objects, including regular graphs, irregular graphs, and two-rowed contingency tables. Greenhill's research includes the analysis of random walks on combinatorial structures and the development of efficient algorithms for generating complex networks. Her studies have applications in network analysis, particularly in examining criminal networks and identifying key actors.