A finite Markov chain is a discrete-state stochastic model where edges connecting nodes of the network are associated with transition probabilities for a fixed time step (discrete-time Markov chain) or transition rates (continuous-time Markov chain). Often, we want to analyse the characteristic features of transitions from an initial set of nodes, 𝔅, to a target set of nodes, 𝔄. Dynamical properties of interest include the occupation probabilities of nodes at equilibrium (illustrated by the sizes of nodes in the above image), the probabilities that nodes are visited along 𝔄 ← 𝔅 trajectories (indicated by node opacity), and the net productive 𝔄 ← 𝔅 flux along edges (indicated by edge thickness). These quantities, and many others, can be determined using the DISCOTRESS software package, either through exact computation by numerically robust algorithms, or estimated from simulation data obtained using efficient path sampling methods.

Finite Markov chains are network models commonly used to represent stochastic processes as varied as animal movement within an ecosystem 🦜🌴, the fluctuating status of financial markets 💸📈, and biomolecules such as proteins or DNA folding to their functional structure 🧬🦠. DISCOTRESS is a powerful and flexible software package to analyse the dynamics of finite Markov chains. The Markov chain dynamics can be studied at both a global level, where the MFPT (mean first passage time; the average time to reach the target state 𝔄 from an initial state 𝔅) is a key quantity, and in detail, by identifying the features of dominant 𝔄 ← 𝔅 paths and quantifying the influence of local states for the transition between two endpoint states 𝔄 and 𝔅.

DISCOTRESS is specifically designed to treat Markov chains featuring a comparatively slow (i.e. low probability) event. This separation of timescales is a common feature of realistic dynamical models - for instance, in a population dynamics model of an ecosystem 🦜🏝️, births and deaths of individuals take place on a fast timescale compared to large-scale changes such as extinction of a species. In general, we are interested in studying a particular 𝔄 ← 𝔅 process representing a significant change in system state that is rare compared to unproductive fluctuations. For Markov chains exhibiting rare event dynamics, standard algorithms to compute dynamical quantities are numerically unstable, and the simple kinetic Monte Carlo (kMC) method to simulate pathways is severely inefficient. DISCOTRESS includes a suite of advanced algorithms that negate these problems, including numerically robust state reduction algorithms to compute exact dynamical quantities, and efficient simulation algorithms to sample paths. Get started with the software here.

I am enthusiastic about creating and analysing computer models to investigate complex real-world problems, especially dynamical processes. I completed a PhD at the University of Cambridge, during which I began development of my DISCOTRESS program. Much of my work deals with the theory of Markov chains, but I am also interested in applications to the modeling of biophysical, ecological, and economic systems. More broadly, I have research interests that encompass stochastic modeling, optimization, network science, and machine learning.

I love wildlife and nature, and I like to spend my free time making visual artworks of critters 🦜🦌🦨🦩🦎🐫 and the landscapes 🏞️ they inhabit, especially the Southwest desert 🏜️ and prairie biomes of North America. I work with graphite and charcoal pencils as well as digital painting.