Related papers: How many paths to simulate correlated Brownian mot…
An American option grants the holder the right to select the time at which to exercise the option, so pricing an American option entails solving an optimal stopping problem. Difficulties in applying standard numerical methods to complex…
In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are…
The standard kinetic path integral for all spatially closed Brownian paths (loops) of duration t weighted by the product mn is evaluated, where m and n are the linking numbers of the Brownian loop with two arbitrary curves in 3D space. The…
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,…
Several methods are currently available to simulate paths of the Brownian motion. In particular, paths of the BM can be simulated using the properties of the increments of the process like in the Euler scheme, or as the limit of a random…
This article provides numerical simulation of an optimal transport path from a single source to an atomic measure of equal total mass. We first construct an initial transport path, and then modify the path as much as possible by using both…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
We state an exact simulation scheme for the first passage time of a Brownian motion to a symmetric linear boundary.
The well-known reflection coupling gives a maximal coupling of two one-dimensional Brownian motions with different starting points. Nevertheless, the reflection coupling does not generalize to more than two Brownian motions. In this paper,…
We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting…
We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…
This work proposes a method for the two-dimensional simulation of Brownian particles in a fluid with restrictions. The method is based on simple numerical rules between two matrices. One of the matrix represent the identification of all…
We study pathwise approximation of scalar stochastic differential equations at a single point. We provide the exact rate of convergence of the minimal errors that can be achieved by arbitrary numerical methods that are based (in a…
A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…
We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…
Consider all the possible ways of coupling together two Brownian motions with the same starting position but with different drifts onto the same probability space. It is known that there exist couplings which make these processes agree for…
Brownian motion on manifolds with non-trivial diffusion coefficient can be constructed by stochastic development of Euclidean Brownian motions using the fiber bundle of linear frames. We provide a comprehensive study of paths for such…
This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further…
We revise the Levy's construction of Brownian motion as a simple though still rigorous approach to operate with various Gaussian processes. A Brownian path is explicitly constructed as a linear combination of wavelet-based "geometrical…
A family of reflected Brownian motions is used to construct Dyson's process of non-colliding Brownian motions. A number of explicit formulae are given, including one for the distribution of a family of coalescing Brownian motions.