A. B. Duncan
Imperial College London
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by A. B. Duncan.
Journal of Statistical Physics | 2016
A. B. Duncan; Tony Lelièvre; Grigorios A. Pavliotis
A standard approach to computing expectations with respect to a given target measure is to introduce an overdamped Langevin equation which is reversible with respect to the target distribution, and to approximate the expectation by a time-averaging estimator. As has been noted in recent papers [30, 37, 61, 72], introducing an appropriately chosen nonreversible component to the dynamics is beneficial, both in terms of reducing the asymptotic variance and of speeding up convergence to the target distribution. In this paper we present a detailed study of the dependence of the asymptotic variance on the deviation from reversibility. Our theoretical findings are supported by numerical simulations.
Physical Review E | 2015
A. B. Duncan; Shuohao Liao; Tomáš Vejchodský; Radek Erban; Ramon Grima
The noisy dynamics of chemical systems is commonly studied using either the chemical master equation (CME) or the chemical Fokker-Planck equation (CFPE). The latter is a continuum approximation of the discrete CME approach. It has recently been shown that for a particular system, the CFPE captures noise-induced multistability predicted by the CME. This phenomenon involves the CMEs marginal probability distribution changing from unimodal to multimodal as the system size decreases below a critical value. We here show that the CFPE does not always capture noise-induced multistability. In particular we find simple chemical systems for which the CME predicts noise-induced multistability, whereas the CFPE predicts monostability for all system sizes.
Journal of Computational Physics | 2016
A. B. Duncan; Radek Erban; Konstantinos C. Zygalakis
Abstract Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25] . While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.
Advances in Applied Probability | 2017
Joris Bierkens; A. B. Duncan
Abstract Markov chain Monte Carlo (MCMC) methods provide an essential tool in statistics for sampling from complex probability distributions. While the standard approach to MCMC involves constructing discrete-time reversible Markov chains whose transition kernel is obtained via the Metropolis–Hastings algorithm, there has been recent interest in alternative schemes based on piecewise deterministic Markov processes (PDMPs). One such approach is based on the zig-zag process, introduced in Bierkens and Roberts (2016), which proved to provide a highly scalable sampling scheme for sampling in the big data regime; see Bierkens et al. (2016). In this paper we study the performance of the zig-zag sampler, focusing on the one-dimensional case. In particular, we identify conditions under which a central limit theorem holds and characterise the asymptotic variance. Moreover, we study the influence of the switching rate on the diffusivity of the zig-zag process by identifying a diffusion limit as the switching rate tends to ∞. Based on our results we compare the performance of the zig-zag sampler to existing Monte Carlo methods, both analytically and through simulations.
Physical Review E | 2016
A. B. Duncan; Serafim Kalliadasis; Grigorios A. Pavliotis; Marc Pradas
We consider the problem of an overdamped Brownian particle moving in multiscale potential with N+1 characteristic length scales: the macroscale and N separated microscales. We show that the coarse-grained dynamics is given by an overdamped Langevin equation with respect to the free energy and with a space-dependent diffusion tensor, the calculation of which requires the solution of N fully coupled Poisson equations. We study in detail the structure of the bifurcation diagram for one-dimensional problems, and we show that the multiscale structure in the potential leads to hysteresis effects and to noise-induced transitions. Furthermore, we obtain an explicit formula for the effective diffusion coefficient for a self-similar separable potential, and we investigate the limit of infinitely many small scales.
Electronic Communications in Probability | 2017
Mikolaj J. Kasprzak; A. B. Duncan; Sebastian J. Vollmer
In [2] foundations for diffusion approximation via Stein’s method are laid. This paper has been cited more than 130 times and is a cornerstone in the area of Stein’s method (see, for example, its use in [1] or [7]). A semigroup argument is used in [2] to solve a Stein equation for Gaussian diffusion approximation. We prove that, contrary to the claim in [2], the semigroup considered therein is not strongly continuous on the Banach space of continuous, real-valued functions on D[0; 1] growing slower than a cubic, equipped with an appropriate norm. We also provide a proof of the exact formulation of the solution to the Stein equation of interest, which does not require the aforementioned strong continuity. This shows that the main results of [2] hold true.
Multiscale Modeling & Simulation | 2015
A. B. Duncan
We study the problem of lateral diffusion on a static, quasi-planar surface generated by a stationary, ergodic random field possessing rapid small-scale spatial fluctuations. The aim is to study the effective behavior of a particle undergoing Brownian motion on the surface, viewed as a projection on the underlying plane. By formulating the problem as a diffusion in a random medium, we are able to use known results from the theory of stochastic homogenization of SDEs to show that, in the limit of small scale fluctuations, the diffusion process behaves quantitatively like a Brownian motion with constant diffusion tensor
Journal of Nonlinear Science | 2015
A. B. Duncan; Charles M. Elliott; Grigorios A. Pavliotis; Andrew M. Stuart
\mathbf{D}
arXiv: Machine Learning | 2016
Jackson Gorham; A. B. Duncan; Sebastian J. Vollmer; Lester W. Mackey
. In one dimension, the effective diffusion coefficient is given by
arXiv: Methodology | 2017
Tigran Nagapetyan; A. B. Duncan; Leonard Hasenclever; Sebastian J. Vollmer; Lukasz Szpruch; Konstantinos C. Zygalakis
\frac{1}{Z^2}