Searcharxiv⌕ Search

arXiv subjects

Steffen Dereich

Publications and source records attributed to Steffen Dereich.

47 records · Page 3Linked to original sources

Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction

We introduce and analyze multilevel Monte Carlo algorithms for the computation of $\mathbb {E}f(Y)$, where $Y=(Y_t)_{t\in[0,1]}$ is the solution of a multidimensional Lévy-driven stochastic differential equation and $f$ is a real-valued function on the path space. The algorithm relies on approximations obtained by simulating large jumps of the Lévy process individually and applying a Gaussian approximation for the small jump part. Upper bounds are provided for the worst case error over the class of all measurable real functions $f$ that are Lipschitz continuous with respect to the supremum norm. These upper bounds are easily tractable once one knows the behavior of the Lévy measure around zero. In particular, one can derive upper bounds from the Blumenthal--Getoor index of the Lévy process. In the case where the Blumenthal--Getoor index is larger than one, this approach is superior to algorithms that do not apply a Gaussian approximation. If the Lévy process does not incorporate a Wiener process or if the Blumenthal--Getoor index $β$ is larger than $\frac{4}{3}$, then the upper bound is of order $τ^{-({4-β})/({6β})}$ when the runtime $τ$ tends to infinity. Whereas in the case, where $β$ is in $[1,\frac{4}{3}]$ and the Lévy process has a Gaussian component, we obtain bounds of order $τ^{-β/(6β-4)}$. In particular, the error is at most of order $τ^{-1/6}$.

math.PR↗

The high resolution vector quantization problem with Orlicz norm distortion

We derive a high-resolution formula for the quantization problem under Orlicz norm distortion. In this setting, the optimal point density solves a variational problem which comprises a function $g:\mathbb{R}_+\to[0,\infty)$ characterizing the quantization complexity of the underlying Orlicz space. Moreover, asymptotically optimal codebooks induce a tight sequence of empirical measures. The set of possible accumulation points is characterized and in most cases it consists of a single element. In that case, we find convergence as in the classical setting.

math.PR↗

Universality of the asymptotics of the one-sided exit problem for integrated processes

We consider the one-sided exit problem for (fractionally) integrated random walks and Lévy processes. We prove that the rate of decrease of the non-exit probability -- the so-called survival exponent -- is universal in this class of processes. In particular, the survival exponent can be inferred from the (fractionally) integrated Brownian motion. This, in particular, extends Sinai's result on the survival exponent for the integrated simple random walk to general random walks with some finite exponential moment. Further, we prove existence and monotonicity of the survival exponent of fractionally integrated processes. We show that this exponent is related to a constant appearing in the study of random polynomials.

math.PR↗

Small deviations of general Lévy processes

We study the small deviation problem $\log\mathbb{P}(\sup_{t\in[0,1]}|X_t|\leq\varepsilon)$, as $\varepsilon\to0$, for general Lévy processes $X$. The techniques enable us to determine the asymptotic rate for general real-valued Lévy processes, which we demonstrate with many examples. As a particular consequence, we show that a Lévy process with nonvanishing Gaussian component has the same (strong) asymptotic small deviation rate as the corresponding Brownian motion.

math.PR↗

Random networks with sublinear preferential attachment: Degree evolutions

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and then have a closer look at the temporal evolution of the degrees of individual vertices, which we describe in terms of large and moderate deviation principles. Using these results, we expose an interesting phase transition: in cases of strong preference of large degrees, eventually a single vertex emerges forever as vertex of maximal degree, whereas in cases of weak preference, the vertex of maximal degree is changing infinitely often. Loosely speaking, the transition between the two phases occurs in the case when a new edge is attached to an existing vertex with a probability proportional to the root of its current degree.

math.PR↗

High resolution quantization and entropy coding of jump processes

We study the quantization problem for certain types of jump processes. The probabilities for the number of jumps are assumed to be bounded by Poisson weights. Otherwise, jump positions and increments can be rather generally distributed and correlated. We show in particular that in many cases entropy coding error and quantization error have distinct rates. Finally, we investigate the quantization problem for the special case of $\mathbb{R}^d$-valued compound Poisson processes.

math.PR↗

The coding complexity of Lévy processes

We investigate the high resolution coding problem for general real-valued Lévy processes under L^p[0,1]-norm distortion. Tight asymptotic formulas are found under mild regularity assumptions.

math.PR↗

The Shannon information of filtrations and the additional logarithmic utility of insiders

The background for the general mathematical link between utility and information theory investigated in this paper is a simple financial market model with two kinds of small traders: less informed traders and insiders, whose extra information is represented by an enlargement of the other agents' filtration. The expected logarithmic utility increment, that is, the difference of the insider's and the less informed trader's expected logarithmic utility is described in terms of the information drift, that is, the drift one has to eliminate in order to perceive the price dynamics as a martingale from the insider's perspective. On the one hand, we describe the information drift in a very general setting by natural quantities expressing the probabilistic better informed view of the world. This, on the other hand, allows us to identify the additional utility by entropy related quantities known from information theory. In particular, in a complete market in which the insider has some fixed additional information during the entire trading interval, its utility increment can be represented by the Shannon information of his extra knowledge. For general markets, and in some particular examples, we provide estimates of maximal utility by information inequalities.

math.PR↗

Infinite-Dimensional Quadrature and Quantization

We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization of the underlying probability measure. In addition to the general setting we analyze in particular integration w.r.t. Gaussian measures and distributions of diffusion processes. We derive lower bounds for the worst case error of every algorithm in terms of its computational cost, and we present matching upper bounds, up to logarithms, and corresponding almost optimal algorithms. As auxiliary results we determine the asymptotic behaviour of quantization numbers and Kolmogorov widths for diffusion processes.

math.PR↗

High-resolution quantization and entropy coding for fractional Brownian motion

We derive a high-resolution formula for the quantization and entropy coding approximation quantities for fractional Brownian motion, respective to the supremum norm and L^p[0,1]-norm distortions. We show that all moments in the quantization problem lead to the same asymptotics. Using a general principle, we conclude that entropy coding and quantization coincide asymptotically. Under supremum-norm distortion, our proof uses an explicit construction of efficient codebooks based on a particular entropy constrained coding scheme. This procedure can be used to construct close to optimal high resolution quantizers.

math.PR↗

The quantization complexity of diffusion processes

We investigate the high resolution coding problem for solutions of stochastic differential equations in the L^p[0,1]- and the C[0,1]-space. Tight asymptotic estimates are found under weak regularity assumptions. The main technical tool is a decoupling method which allows us to relate the complexity of the diffusion process to that of the Wiener process under certain random distortions.

math.PR↗