%0 Journal Article
%@ 1350-7265
%A Beskos, A
%A Peluchetti, S
%A Roberts, G
%D 2012
%F discovery:1325568
%I INT STATISTICAL INST
%J Bernoulli
%K Brownian bridge, intersection layer, iterative algorithm, option pricing, pathwise convergence, unbiased sampling
%N 4
%P 1223-1248
%T epsilon-Strong simulation of the Brownian path
%U https://discovery.ucl.ac.uk/id/eprint/1325568/
%V 18
%X We present an iterative sampling method which delivers upper and lower bounding processes for the Brownian path. We develop such processes with particular emphasis on being able to unbiasedly simulate them on a personal computer. The dominating processes converge almost surely in the supremum and L1L1 norms. In particular, the rate of converge in L1L1 is of the order O(K−1/2)O(K−1/2), KK denoting the computing cost. The a.s. enfolding of the Brownian path can be exploited in Monte Carlo applications involving Brownian paths whence our algorithm (termed the εε-strong algorithm) can deliver unbiased Monte Carlo estimators over path expectations, overcoming discretisation errors characterising standard approaches. We will show analytical results from applications of the εε-strong algorithm for estimating expectations arising in option pricing. We will also illustrate that individual steps of the algorithm can be of separate interest, giving new simulation methods for interesting Brownian distributions.
%Z This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions.