Related papers: Randomisation and recursion methods for mixed-expo…
In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a…
We study a Monte Carlo algorithm for simulation of probability distributions based on stochastic step functions, and compare to the traditional Metropolis/Hastings method. Unlike the latter, the step function algorithm can produce an…
This paper considers the class of L\'evy processes that can be written as a Brownian motion time changed by an independent L\'evy subordinator. Examples in this class include the variance gamma model, the normal inverse Gaussian model, and…
We propose a novel estimation framework for path-dependent functionals of Levy processes from discretely observed data. Traditional approaches rely on Monte Carlo simulation of full paths, which requires complete model specification and…
We present a new method for simulating Markovian jump processes with time-dependent transitions rates, which avoids the transformation of random numbers by inverting time integrals over the rates. It relies on constructing a sequence of…
In this study, we address the central issue of statistical inference for Markov jump processes using discrete time observations. The primary problem at hand is to accurately estimate the infinitesimal generator of a Markov jump process, a…
In this paper, we present a very fast Monte Carlo scheme for additive processes: the computational time is of the same order of magnitude of standard algorithms for Brownian motions. We analyze in detail numerical error sources and propose…
We propose sequential Monte Carlo (SMC) methods for sampling the posterior distribution of state-space models under highly informative observation regimes, a situation in which standard SMC methods can perform poorly. A special case is…
Reversible jump Markov chain Monte Carlo (RJMCMC) proposals that achieve reasonable acceptance rates and mixing are notoriously difficult to design in most applications. Inspired by recent advances in deep neural network-based normalizing…
Many problems in finance require the information on the first passage time (FPT) of a stochastic process. Mathematically, such problems are often reduced to the evaluation of the probability density of the time for such a process to cross a…
In this work we develop an effective Monte Carlo method for estimating sensitivities, or gradients of expectations of sufficiently smooth functionals, of a reflected diffusion in a convex polyhedral domain with respect to its defining…
We develop a computational method for expected functionals of the drawdown and its duration in exponential L\'evy models. It is based on a novel simulation algorithm for the joint law of the state, supremum and time the supremum is attained…
A key design constraint when implementing Monte Carlo and variational inference algorithms is that it must be possible to cheaply and exactly evaluate the marginal densities of proposal distributions and variational families. This takes…
We analyse a multilevel Monte Carlo method for the approximation of distribution functions of univariate random variables. Since, by assumption, the target distribution is not known explicitly, approximations have to be used. We provide an…
We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the…
L\'evy Flights are paradigmatic generalised random walk processes, in which the independent stationary increments---the "jump lengths"---are drawn from an $\alpha$-stable jump length distribution with long-tailed, power-law asymptote. As a…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
Recently a new class of Monte Carlo methods, called Time Relaxed Monte Carlo (TRMC), designed for the simulation of the Boltzmann equation close to fluid regimes have been introduced. A generalized Wild sum expansion of the solution is at…
The aim of this paper is to introduce a new Monte Carlo method based on importance sampling techniques for the simulation of stochastic differential equations. The main idea is to combine random walk on squares or rectangles methods with…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…