Related papers: Shadows and Barriers
The problem of reconciling a prior probability law on paths with data was introduced by E. Schr\"odinger in 1931/32. It represents an early formulation of a maximum likelihood problem. This specific formulation can also be seen as the…
In this paper, we introduce a new kind of "variant" reflected backward doubly stochastic differential equations (VRBDSDEs in short), where the drift is the nonlinear function of the barrier process. In the one stochastic case, this type of…
A Schr\"odinger bridge is the most probable time-dependent probability distribution that connects an initial probability distribution $w_{i}$ to a final one $w_{f}$. The problem has been solved and widely used for the case of simple…
In this paper, we investigate Monge-Kantorovich problems for which the absolute continuity of marginals is relaxed. For $X,Y\subseteq\mathbb{R}^{n+1}$ let $(X,\mathcal{B}_X,\mu)$ and $(Y,\mathcal{B}_Y,\nu)$ be two Borel probability spaces,…
Let $X=(X_t)_{t\ge0}$ be a transient diffusion process in $(0,\infty)$ with the diffusion coefficient $\sigma>0$ and the scale function $L$ such that $X_t\rightarrow\infty$ as $t\rightarrow \infty$, let $I_t$ denote its running minimum for…
In this paper, we study the initial-boundary value problem for the stochastic Landau-Lifshitz-Baryakhtar (SLLBar) equation with Stratonovich-type noise in bounded domains $\mathcal{O}\subset\mathbb{R}^d$, $d=1,2,3$. Our main results can be…
We consider the problem of computing an approximate banded solution of the continuous-time Lyapunov equation $\underline{A}\underline{X}+\underline{X}\underline{A}^{T}=\underline{P}$, where the coefficient matrices $\underline{A}$ and…
The purpose of the present work is to expand substantially the type of control and estimation problems that can be addressed following the paradigm of Schr\"odinger bridges, by incorporating termination (killing) of stochastic flows.…
We propose a novel framework, called moving window method, for solving the linear Schr\"odinger equation with an external potential in $\mathbb{R}^d$. This method employs a smooth cut-off function to truncate the equation from Cauchy…
We prove that among all doubly connected domains of $\mathbb{R}^n$ of the form $B_1\backslash \overline{B_2}$, where $B_1$ and $B_2$ are open balls of fixed radii such that $\overline{B_2}\subset B_1$, the first nonzero Steklov eigenvalue…
The Az\'{e}ma-Yor solution (resp., the Perkins solution) of the Skorokhod embedding problem has the property that it maximizes (resp., minimizes) the law of the maximum of the stopped process. We show that these constructions have a wider…
The problem of interpolating a rigid body motion is to find a spatial trajectory between a prescribed initial and terminal pose. Two variants of this interpolation problem are addressed. The first is to find a solution that satisfies…
Electric S-brane solutions with two non-composite electric branes and a set of l scalar fields are considered. The intersection rules for branes correspond to Lie algebras A_2, C_2 and G_2. The solutions contain five factor spaces. One of…
In this paper, the tunnelling of a particle through a potential barrier is investigated in the presence of a time-dependent perturbation. The latter is attributed to the process of the energy measurement of the scattered particle. The…
Semimartingale reflecting Brownian motions (SRBMs) living in the closures of domains with piecewise smooth boundaries are of interest in applied probability because of their role as heavy traffic approximations for some stochastic networks.…
The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\mu : P \to \mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\tau : P \times…
In this article we investigate entropic interpolations. These measure valued curves describe the optimal solutions of the Schr{\"o}dinger problem [Sch31], which is the problem of finding the most likely evolution of a system of independent…
The largest common embeddable subtree problem asks for the largest possible tree embeddable into two input trees and generalizes the classical maximum common subtree problem. Several variants of the problem in labeled and unlabeled rooted…
The inverse first passage time problem asks whether, for a Brownian motion $B$ and a nonnegative random variable $\zeta$, there exists a time-varying barrier $b$ such that $\mathbb{P}\{B_s>b(s),0\leq s\leq t\}=\mathbb{P}\{\zeta>t\}$. We…
We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process $X$. We consider classic and randomized stopping times represented by…