SearcharxivSearch

arXiv subjects

M. R. Pistorius

Publications and source records attributed to M. R. Pistorius.

7 recordsLinked to original sources

On Future Drawdowns of Lévy processes

For a given Lévy process $X=(X_t)_{t\in\mathbb{R}_+}$ and for fixed $s\in \mathbb{R}_{+}\cup\{\infty\}$ and $t\in\mathbb{R}_+$ we analyse the {\it future drawdown extremes} that are defined as follows: \begin{eqnarray*} \overline D^*_{t,s} = \sup_{0\leq u\leq t} \inf_{u\leq w < t+s}(X_w-X_u), \qquad\qquad \underline D^*_{t,s} = \inf_{0\leq u\leq t} \inf_{u\leq w < t+s}(X_w-X_u). \end{eqnarray*} The path-functionals $\overline D^*_{t,s}$ and $\underline D^*_{t,s}$ are of interest in various areas of application, including financial mathematics and queueing theory. In the case that $X$ has a strictly positive mean, we find the exact asymptotic decay as $x\to\infty$ of the tail probabilities $\mathbb{P}(\overline D^*_{t}<x)$ and $\mathbb{P}(\underline D^*_t<x)$ of $\overline D^*_{t}=\lim_{s\to\infty}\overline D^*_{t,s}$ and $\underline D^*_{t} = \lim_{s\to\infty}\underline D^*_{t,s}$ both when the jumps satisfy the Cramér assumption and in a heavy-tailed case. Furthermore, in the case that the jumps of the Lévy process $X$ are of single sign and $X$ is not subordinator, we identify the one-dimensional distributions in terms of the scale function of $X$. By way of example, we derive explicit results for the Black-Scholes-Samuelson model.

math.PR

Explicit solution of an inverse first-passage time problem for Lévy processes and counterparty credit risk

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 first-passage time $τ_b=\inf \{t\ge0:X(t)<b(t)\}$ is given by $\overline{H}$. In this paper, we consider a version of the IFPT problem where the barrier is fixed at zero and the problem is to find an initial distribution $μ$ and a time-change $I$ such that for the time-changed process $X\circ I$ the IFPT problem is solved by a constant barrier at the level zero. For any Lévy process $X$ satisfying an exponential moment condition, we derive the solution of this problem in terms of $λ$-invariant distributions of the process $X$ killed at the epoch of first entrance into the negative half-axis. We provide an explicit characterization of such distributions, which is a result of independent interest. For a given multi-variate survival function $\overline{H}$ of generalized frailty type, we construct subsequently an explicit solution to the corresponding IFPT with the barrier level fixed at zero. We apply these results to the valuation of financial contracts that are subject to counterparty credit risk.

math.PR

On Gerber-Shiu functions and optimal dividend distribution for a Lévy risk process in the presence of a penalty function

This paper concerns an optimal dividend distribution problem for an insurance company whose risk process evolves as a spectrally negative Lévy process (in the absence of dividend payments). The management of the company is assumed to control timing and size of dividend payments. The objective is to maximize the sum of the expected cumulative discounted dividend payments received until the moment of ruin and a penalty payment at the moment of ruin, which is an increasing function of the size of the shortfall at ruin; in addition, there may be a fixed cost for taking out dividends. A complete solution is presented to the corresponding stochastic control problem. It is established that the value-function is the unique stochastic solution and the pointwise smallest stochastic supersolution of the associated HJB equation. Furthermore, a necessary and sufficient condition is identified for optimality of a single dividend-band strategy, in terms of a particular Gerber-Shiu function. A number of concrete examples are analyzed.

math.PR

On matrix exponential approximations of the infimum of a spectrally negative Levy process

We recall four open problems concerning constructing high-order matrix-exponential approximations for the infimum of a spectrally negative Levy process (with applications to first-passage/ruin probabilities, the waiting time distribution in the M/G/1 queue, pricing of barrier options, etc). On the way, we provide a new approximation, for the perturbed Cramer-Lundberg model, and recall a remarkable family of (not minimal order) approximations of Johnson and Taaffe, which fit an arbitrarily high number of moments, greatly generalizing the currently used approximations of Renyi, De Vylder and Whitt-Ramsay. Obtaining such approximations which fit the Laplace transform at infinity as well would be quite useful.

math.PR

On perpetual American put valuation and first-passage in a regime-switching model with jumps

In this paper we consider the problem of pricing a perpetual American put option in an exponential regime-switching Lévy model. For the case of the (dense) class of phase-type jumps and finitely many regimes we derive an explicit expression for the value function. The solution of the corresponding first passage problem under a state-dependent level rests on a path transformation and a new matrix Wiener-Hopf factorization result for this class of processes.

q-fin.PR

On maxima and ladder processes for a dense class of Levy processes

Consider the problem to explicitly calculate the law of the first passage time T(a) of a general Levy process Z above a positive level a. In this paper it is shown that the law of T(a) can be approximated arbitrarily closely by the laws of T^n(a), the corresponding first passages time for X^n, where (X^n)_n is a sequence of Levy processes whose positive jumps follow a phase-type distribution. Subsequently, explicit expressions are derived for the laws of T^n(a) and the upward ladder process of X^n. The derivation is based on an embedding of X^n into a class of Markov additive processes and on the solution of the fundamental (matrix) Wiener-Hopf factorisation for this class. This Wiener-Hopf factorisation can be computed explicitly by solving iteratively a certain fixed point equation. It is shown that, typically, this iteration converges geometrically fast.

math.PR