Related papers: Shadows and Barriers
Standard Markovian optimal stopping problems are consistent in the sense that the first entrance time into the stopping set is optimal for each initial state of the process. Clearly, the usual concept of optimality cannot in a…
Let $W$ be a standard Brownian motion with $W_0 = 0$ and let $b: \mathbb{R}_+ \to \mathbb{R}$ be a continuous function with $b(0) > 0$. The first passage time (from below) is then defined as \begin{align*} \tau := \inf \{ t \geq 0 \vert W_t…
For a given Markov process $X$ and survival function $\overline{H}$ on $\mathbb{R}^+$, the inverse first-passage time problem (IFPT) is to find a barrier function $b:\mathbb{R}^+\to[-\infty,+\infty]$ such that the survival function of the…
The time domain enclosure method is one of analytical methods for inverse obstacle problems governed by partial differential equations in the time domain. This paper considers the case when the governing equation is given by the Maxwell…
In a recent work by Gross, it was proved that, given a distribution $\mu$ with zero mean and finite second moment, we can find a simply connected domain $\Omega$ such that if $Z_{t}$ is a standard planar BM, then…
Entropic Optimal Transport (EOT), also referred to as the Schr\"odinger problem, seeks to find a random processes with prescribed initial/final marginals and with minimal relative entropy with respect to a reference measure. The relative…
We present a numerical framework to approximate the $\mu$-domain in the planar Skorokhod embedding problem (PSEP), recently appeared in \cite{gross2019}. Our approach investigates the continuity and convergence properties of the solutions…
We study exit times from time-dependent domains under joint perturbations of the trajectory and the domain. Representing a moving domain by a continuous barrier $\Phi$ on space-time, we reduce the exit problem to a one-dimensional…
We consider the initial boundary value problem \begin{eqnarray*}u_t=\mu u_x+\tfrac{1}{2}u_{xx}\qquad (t>0,x\ge0),\\u(0,x)=f(x)\qquad (x\ge0),\\u_t(t,0)=\nu u_x(t,0)\qquad (t>0)\end{eqnarray*} of Stroock and Williams [Comm. Pure Appl. Math.…
Optimal Transport (OT) problems arise in a wide range of applications, from physics to economics. Getting numerical approximate solution of these problems is a challenging issue of practical importance. In this work, we investigate the…
By using the Skorohod equation we derive an iteration procedure which allows us to solve a class of reflected backward stochastic differential equations with non-linear resistance induced by the reflected local time. In particular, we…
We solve by Chebyshev spectral collocation some genuinely nonlinear Liouville-Bratu-Gelfand type, 1D and a 2D boundary value problems. The problems are formulated on the square domain $[-1, 1]\times[-1, 1]$ and the boundary condition…
In this paper we study the problem of stopping a Brownian bridge $X$ in order to maximise the expected value of an exponential gain function. In particular, we solve the stopping problem $$\sup_{0\le \tau\le…
We examine the optimal mass transport problem in $\mathbb{R}^{n}$ between densities having independent compact support by considering the geometry of a continuous interpolating support boundary in space-time within which the mass density…
We consider systems of backward stochastic differential equations with c\`adl\`ag upper barrier $U$ and oblique reflection from below driven by an increasing continuous function $H$. Our equations are defined on general probability spaces…
We develop novel numerical methods and perturbation approaches to determine the mean first passage time (MFPT) for a Brownian particle to be captured by either small stationary or mobile traps inside a bounded 2-D confining domain. Of…
The \emph{Schr\"odinger problem} is obtained by replacing the mean square distance with the relative entropy in the Monge-Kantorovich problem. It was first addressed by Schr\"odinger as the problem of describing the most likely evolution of…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are…
Over the last several years, there has been significant progress in developing neural solvers for the Schr\"odinger Bridge (SB) problem and applying them to generative modelling. This new research field is justifiably fruitful as it is…
In this paper we address the numerical solution of the quadratic optimal transport problem in its dynamical form, the so-called Benamou-Brenier formulation. When solved using interior point methods, the main computational bottleneck is the…