Related papers: Path Decomposition of Spectrally Negative Levy Pro…
The {\em drawdown} process $Y$ of a completely asymmetric L\'{e}vy process $X$ is equal to $X$ reflected at its running supremum $\bar{X}$: $Y = \bar{X} - X$. In this paper we explicitly express in terms of the scale function and the…
We use Levy processes to generate joint prior distributions, and therefore penalty functions, for a location parameter as p grows large. This generalizes the class of local-global shrinkage rules based on scale mixtures of normals,…
Nonparametric methods for the estimation of the Levy density of a Levy process are developed. Estimators that can be written in terms of the ``jumps'' of the process are introduced, and so are discrete-data based approximations. A model…
We analyze the general L\'{e}vy insurance risk process for L\'{e}vy measures in the convolution equivalence class $\mathcal{S}^{(\alpha)}$, $\alpha>0$, via a new kind of path decomposition. This yields a very general functional limit…
The path probability of stochastic motion of non dissipative or quasi-Hamiltonian systems is investigated by numerical experiment. The simulation model generates ideal one-dimensional motion of particles subject only to conservative forces…
A refracted L\'evy process is a L\'evy process whose dynamics change by subtracting off a fixed linear drift (of suitable size) whenever the aggregate process is above a pre-specified level. More precisely, whenever it exists, a refracted…
Let {X_{t_1,t_2}: t_1,t_2 >= 0} be a two-parameter L\'evy process on R^d. We study basic properties of the one-parameter process {X_{x(t),y(t)}: t \in T} where x and y are, respectively, nondecreasing and nonincreasing nonnegative…
To study gap acceptance behaviour one needs the distribution (or probability density function) of gaps in the opposing stream. Further, in these times of widespread availability of large computing powers, traffic simulation has emerged as a…
Inverse problems arise in situations where data is available, but the underlying model is not. It can therefore be necessary to infer the parameters of the latter starting from the former. Statistical mechanics offers a toolbox of…
Integral representations for expectations of functions of a stable L\'evy process $X$ and its supremum $\bar X$ are derived. As examples, cumulative probability distribution functions (cpdf) of $X_T, \barX_T$, the joint cpdf of $X_T$ and…
Given a spectrally negative L\'evy process, we predict, in a $L_1$ sense, the last passage time of the process below zero before an independent exponential time. This optimal prediction problem generalises Baurdoux and Pedraza (2020) where…
We consider a class of L\'evy-type processes on which spectral analysis technics can be made to produce optimal results, in particular for the decay rate of their survival probability and for the spectral gap of their ground state…
This work proposes an extension of the 1-D Hilbert Huang transform for the analysis of images. The proposed method consists in (i) adaptively decomposing an image into oscillating parts called intrinsic mode functions (IMFs) using a mode…
The paper develops new methods of non-parametric estimation a compound Poisson distribution. Such a problem arise, in particular, in the inference of a Levy process recorded at equidistant time intervals. Our key estimator is based on…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We obtain the first near-linear time deterministic algorithm for negative-weight single-source shortest paths on integer-weighted graphs. Our main ingredient is a deterministic construction of a padded decomposition on directed graphs,…
It is known that in many cases distributions of exponential integrals of Levy processes are infinitely divisible and in some cases they are also selfdecomposable. In this paper, we give some sufficient conditions under which distributions…
In this paper we derive a technique of obtaining limit theorems for suprema of L\'evy processes from their random walk counterparts. For each $a>0$, let $\{Y^{(a)}_n:n\ge 1\}$ be a sequence of independent and identically distributed random…
This work introduces progressive spatio-temporal filtering, an efficient method to build all-frequency approximations to the light transport distribution into a scene by filtering individual samples produced by an underlying path sampler,…
A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…