Related papers: Shifting processes with cyclically exchangeable in…

We consider Kallenberg's hypothesis on the characteristic function of a L\'{e}vy process and show that it allows the construction of weakly continuous bridges of the L\'{e}vy process conditioned to stay positive. We therefore provide a…

For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(\tau(f)+t \mod1)+f(1)1_{\{t+\tau(f) \geq 1\}}-f(\tau(f))$, where $\tau(f)$ corresponds to the first time at which the minimum of $f$ is attained.…

For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(\tau(f)+t \mod1)+f(1)1_{\{t+\tau(f) \geq 1\}}-f(\tau(f))$, where $\tau(f)$ corresponds to the first time at which the minimum of $f$ is attained.…

We consider a L\'evy process that starts from $x<0$ and conditioned on having a positive maximum. When Cram\'er's condition holds, we provide two weak limit theorems as $x\to -\infty$ for the law of the (two-sided) path shifted at the first…

We construct the law of L\'{e}vy processes conditioned to stay positive under general hypotheses. We obtain a Williams type path decomposition at the minimum of these processes. This result is then applied to prove the weak convergence of…

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 provides a multivariate extension of Bertoin's pathwise construction of a L\'evy process conditioned to stay positive/negative. Thus obtained processes conditioned to stay in half-spaces are closely related to the original…

In a recent work J. Pitman and W. Tang defined the Vervaat's transform for a Brownian bridge with two different endpoints and for a Brownian motion between times $0$ and $1$. They proved some path decomposition properties for these…

The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…

Fractional Brownian motion is a self-affine, non-Markovian and translationally invariant generalization of Brownian motion, depending on the Hurst exponent $H$. Here we investigate fractional Brownian motion where both the starting and the…

Takeda-Yano determined the limit of L\'{e}vy processes conditioned to avoid zero via various random clocks in terms of Doob's $h$-transform, where the limit processes may differ according to the choice of random clocks. The purpose of this…

We characterize the small-time asymptotic behavior of the exit probability of a L\'evy process out of a two-sided interval and of the law of its overshoot, conditionally on the terminal value of the process. The asymptotic expansions are…

Last passage times arise in a number of areas of applied probability, including risk theory and degradation models. Such times are obviously not stopping times since they depend on the whole path of the underlying process. We consider the…

A Markovian bridge is a probability measure taken from a disintegration of the law of an initial part of the path of a Markov process given its terminal value. As such, Markovian bridges admit a natural parameterization in terms of the…

Let $L = (L(t))_{t\geq 0}$ be a multivariate L\'evy process with L\'evy measure $\nu(dy) = \exp(-f(|y|)) dy$ for a smoothly regularly varying function $f$ of index $\alpha>1$. The process $L$ is renormalized as $X^\varepsilon(t) =…

Transition of a system between two states is an important but difficult problem in natural science. In this article we study the transition problem in the framework of transition path ensemble. Using the overdamped Langevin method, we…

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…

An obvious way to simulate a L\'evy process $X$ is to sample its increments over time $1/n$, thus constructing an approximating random walk $X^{(n)}$. This paper considers the error of such approximation after the two-sided reflection map…

Let $X$ be an exchangeable increment (EI) process whose sample paths are of infinite variation. We prove that, for any fixed $t$ almost surely, \[ \limsup_{h\to 0 \pm} (X_{t+h}-X_t)/h=\infty \quad\text{and}\quad \liminf_{h\to 0\pm}…

Random Bridges have gained significant attention in recent years due to their potential applications in various areas, particularly in information-based asset pricing models. This paper aims to explore the potential influence of the pinning…