Here is some information about some staff in the Centre for Discrete Mathematics and their interests.
David Arrowsmith’s interests include dynamical systems and networks. Recently he has been involved in leading several research initiatives on the vulnerability of infrastructure networks, specifically gas networks at the European level, with the intention of extracting useful information for energy and government agencies. His personal web page is here.
Peter Cameron’s interests include permutation groups, and the (finite or infinite) structures on which they can act (which may be designs, graphs, codes, geometries, etc.). Those countably infinite structures with the most symmetry are the ones which can be specified by first-order logical axioms; this is a general framework which includes many counting problems for types of finite structures. He has run the Combinatorics Study Group at Queen Mary for twenty-five years. His personal web page is here. He also runs a blog, as Cameron counts.
His research is in complex systems and complex networks. His main interest is to characterize and model the structure of large real-world networks, such as the human brain or social interactions, and to understand how the structure affects the dynamics of the system and the emergence of collective behaviours. Vito’s personal web page is here.
His research includes Proof Complexity, Algebraic proof complexity, Information Theory and Network Coding. Søren’s personal web page is here.
Mark Jerrum works in theoretical computer science, specifically in theanalysis of algorithms and computational complexity. His research has strong connections to probability theory and statistical physics as well as combinatorics. More details can be found on his personal web page.
My interests are at the interface of algebra and combinatorics. On the algebraic side, I work on the representation theory of the symmetric groups (mostly in characteristic p) and related objects, such as Coxeter groups and Hecke algebras. This has strong connections with the combinatorics of partitions, and some of my research is in purely combinatorial work arising from these areas of algebra. My web page is here.
His research interests are mainly in computational and algebraic graph theory, and combinatorial and statistical design theory. Leonard is the author of two packages for the GAP computer algebra system: the GRAPE package for computing with graphs with groups acting on them, and the DESIGN package for constructing, classifying, partitioning and analysing block designs. His personal web page is here.
My research interests are in graph theory, matroid theory, discrete geometry and combinatorial optimization. My personal web page is here.
Robert Johnson’s research is in combinatorics and graph theory. He is particularly interested in extremal problems for graphs and set systems. A specific area of interest lying at the interface of graphs and sets is the combinatorics of the discrete hypercube. His personal webpage is here.
His main interest is random combinatorics, particularly randomness with some underlying structure. This includes examples such as percolation, random geometric graphs and random cellular automata. He also has a significant interest in Ramsey Theory. His personal webpage is here.
My research interests include discrete probability; random graphs; Markov chains; applications to epidemic and population models, communication networks and statistical mechanics. My personal web page is here.