Related papers: On extension of the Markov chain approximation met…
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given…
Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove,…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
The challenge to fruitfully merge state-of-the-art techniques from mathematical finance and numerical analysis has inspired researchers to develop fast deterministic option pricing methods. As a result, highly efficient algorithms to…
This paper is concerned with the development of rigorous approximations to various expectations associated with Markov chains and processes having non-stationary transition probabilities. Such non-stationary models arise naturally in…
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,…
This paper develops power series expansions of a general class of moment functions, including transition densities and option prices, of continuous-time Markov processes, including jump--diffusions. The proposed expansions extend the ones…
We propose an approach to compute the boundary crossing probabilities for a class of diffusion processes which can be expressed as piecewise monotone (not necessarily one-to-one) functionals of a standard Brownian motion. This class…
We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive…
The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention…
In this paper we examine the numerical approximation of the limiting invariant measure associated with Feynman-Kac formulae. These are expressed in a discrete time formulation and are associated with a Markov chain and a potential function.…
We consider a time-average estimator $f_{k}$ of a functional of a Markov chain. Under a coupling assumption, we show that the expectation of $f_{k}$ has a limit $\mu$ as the number of time-steps goes to infinity. We describe a modification…
We provide a mathematical study of the modified Diffusion Monte Carlo (DMC) algorithm introduced in the companion article \cite{DMC}. DMC is a simulation technique that uses branching particle systems to represent expectations associated…
This article provides a new theory for the analysis of forward and backward particle approximations of Feynman-Kac models. Such formulae are found in a wide variety of applications and their numerical (particle) approximation are required…
We present a novel algorithm to solve a non-linear system of equations, whose solution can be interpreted as a tight lower bound on the vector of expected hitting times of a Markov chain whose transition probabilities are only partially…
We present a new method to sample conditioned trajectories of a system evolving under Langevin dynamics, based on Brownian bridges. The trajectories are conditioned to end at a certain point (or in a certain region) in space. The bridge…
This article establishes sufficient conditions for a linear-in-time bound on the non-asymptotic variance of particle approximations of time-homogeneous Feynman-Kac formulae. These formulae appear in a wide variety of applications including…
We propose a novel non-compact, positivity-preserving scheme for linear non-divergence form elliptic equations. Based on the Feynman--Kac formula, the solution is represented as a conditional expectation associated with a diffusion…
Many approaches for conducting Bayesian inference on discretely observed diffusions involve imputing diffusion bridges between observations. This can be computationally challenging in settings in which the temporal horizon between…
Functionals of Brownian motion have diverse applications in physics, mathematics, and other fields. The probability density function (PDF) of Brownian functionals satisfies the Feynman-Kac formula, which is a Schrodinger equation in…