I am a Reader in Statistics within the Mathematics and Statistics Department at Lancaster University. On these pages you will find information about my research and professional activities.


My research interests include:

  • Markov chain Monte Carlo (MCMC):
    • theory on convergence and efficiency of MCMC algorithms;
    • methodology such as pseudo-marginal MCMC and non-reversible MCMC;
    • application of MCMC, especially in areas such as systems biology, ecology, the environment and epidemiology.
  • Particle filters and Sequential Monte Carlo - especially their use within MCMC algorithms.
  • Use of Markov jump processes and diffusions for Bayesian inference in systems biology and ecology - in particular developing new bridges for use in particle MCMC algorithms.
  • More general statistical inference for ecology, epidemiology and the environment.

Research-level tutorials

Pseudo-marginal MCMC opened up inference for SDEs and MJPs to a relatively standard approach using particle filters; here is a simple explanation of the basics and (partial) review of the literature.
Variational representations of Markov kernels can be powerful tools in the analysis of their behaviour; here [arXiv] is a description of three that I have found useful.
During my PhD I found out a little about particle filters. Here is an introduction to the SIR and ASIR filters - an explanation for beginners.


If you are interested in studying for a PhD with me then please contact me at the email address on the right. Example research areas include:

1. Non-reversible MCMC. Standard MCMC is reversible: on a uniform target, for example, the probability of moving from A to B is the same as the probability of moving from B to A. Hence there is a natural tendency for the algorithm to meander, with a distance proportional to n^1/2 covered in n iterations. Interesting non-reversible MCMC algorithms retain a sense of direction and have the potential for exploring the space much more efficiently. Examples include Hamiltonion Monte Carlo and the discrete bouncy particle sampler as well at continuous-time algorithms such as the bouncy particle sampler and the zig-zag sampler. An example project might look at developing a new non-reversible algorithm and applying it to some interesting application type.
2. MCMC for reaction networks. Consider a set of species: this could be literal, such as foxes and rabbits, or a protein and its dimer, or could be classes such as people susceptible to a disease, people infected with a disease and people who have recovered from the disease. The different species interact through "reactions" (e.g. a fox eats a rabbit) and the rate of these reactions depends on the current numbers of the relevant species (e.g. the more foxes and rabbits there are, the more rabbits are eaten each day). A reaction network is the continuous-time Markov chain whose state is the current number of each species. Interest may lie in the forms of the reactions and their rates, in the current or historical species numbers, future prediction, or even all three. An example project might create a new, more efficient inference methodology for a subclass of reaction networks and apply to an autoregulatory gene network.


I am (2019-present) the group lead for the Computational Statistics group. From 2013-2019 I was the Programme Tutor for the MSc in Statistics. From 2007-2013 I was Admissions Tutor for the MSc in Statistics.

Other links


Click here for a potted career history, and here for other stuff.