Search arXivSearch

arXiv · math/0703597

An explicit Skorokhod embedding for spectrally negative Levy processes

Abstract

We present an explicit solution to the Skorokhod embedding problem for spectrally negative Lévy processes. Given a process $X$ and a target measure $μ$ satisfying an explicit admissibility condition we define functions $\f_\pm$ such that the stopping time $T = \inf\{t>0: X_t \in \{-\f_-(L_t), \f_+(L_t)\}\}$ induces $X_T\sim μ$. We also treat versions of $T$ which take into account the sign of the excursion straddling time $t$. We prove that our stopping times are minimal and we describe criteria under which they are integrable. We compare our solution with the one proposed by Bertoin and Le Jan (1992) and we compute explicitly their general quantities in our setup. Our method relies on some new explicit calculations relating scale functions and the Itô excursion measure of $X$. More precisely, we compute the joint law of the maximum and minimum of an excursion away from 0 in terms of the scale function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Obloj, Martijn Pistorius. 2008-03-27. An explicit Skorokhod embedding for spectrally negative Levy processes. https://doi.org/10.1007/s10959-008-0157-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

On the Wasserstein distance between a hyperuniform point process and its mean

We study the existence of bounds on the expected $p$-Wasserstein distance between a random measure and its mean under the assumption that the $p$-th centered moments of the counting statistics are controlled uniformly in space. The average Wasserstein transport cost is shown to be bounded from above and from below by some multiples of the number of points. $D$-dimensional versions of those results are also obtained. As a corollary, we prove that for any value of $p\geq 1$ the Ginibre point process can be seen as a perturbed lattice with identically distributed perturbations with a finite $p$-th moment.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR