Related papers: The coding complexity of L\'evy processes
L\'{e}vy processes with completely monotone jumps appear frequently in various applications of probability. For example, all popular stock price models based on L\'{e}vy processes (such as the Variance Gamma, CGMY/KoBoL and Normal Inverse…
The sharp asymptotics for the L^2-quantization errors of Gaussian measures on a Hilbert space and, in particular, for Gaussian processes is derived. The condition imposed is regular variation of the eigenvalues.
We derive a criterium for the almost sure finiteness of perpetual integrals of \LL processes for a class of real functions including all continuous functions and for general one-dimensional L\'evy processes that drifts to plus infinity.…
We construct intrinsic on-and off-diagonal upper and lower estimates for the transition probability density of a L\'evy process in small time. By intrinsic we mean that such estimates reflect the structure of the characteristic exponent of…
In contrast to their seemingly simple and shared structure of independence and stationarity, L\'evy processes exhibit a wide variety of behaviors, from the self-similar Wiener process to piecewise-constant compound Poisson processes.…
In this paper, we address rare-event simulation for heavy-tailed L\'evy processes with infinite activities. The presence of infinite activities poses a critical challenge, making it impractical to simulate or store the precise sample path…
In this paper, we consider projection estimates for L\'evy densities in high-frequency setup. We give a unified treatment for different sets of basis functions and focus on the asymptotic properties of the maximal deviation distribution for…
We derive a high-resolution formula for the $L^2$-quantization errors of Riemann-Liouville processes and the sharp Kolmogorov entropy asymptotics for related Sobolev balls. We describe a quantization procedure which leads to asymptotically…
This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…
For a number of lossy source coding problems it is shown that even if the usual single-letter sum-rate-distortion expressions may become invalid for non-infinite distortion functions, they can be approached, to any desired accuracy, via the…
In this paper we first provide several conditional limit theorems for L\'evy processes with negative drift and regularly varying tail. Then we apply them to study the asymptotic behavior of expectations of some exponential functionals of…
Modern program verifiers use logic-based encodings of the verification problem that are discharged by a back end reasoning engine. However, instances of such encodings for large programs can quickly overwhelm these back end solvers. Hence,…
We propose isomorphism type identities for nonlinear functionals of general infinitely divisible processes. Such identities can be viewed as an analogy of the Cameron-Martin formula for Poissonian infinitely divisible processes but with…
A spectral representation for regularly varying L\'evy processes with index between one and two is established and the properties of the resulting random noise are discussed in detail giving also new insight in the $L^2$-case where the…
Linear computation coding is concerned with the compression of multidimensional linear functions, i.e. with reducing the computational effort of multiplying an arbitrary vector to an arbitrary, but known, constant matrix. This paper…
We prove $L_p$ estimates of solutions to a conormal derivative problem for divergence form complex-valued higher-order elliptic systems on a half space and on a Reifenberg flat domain. The leading coefficients are assumed to be merely…
A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…
Large language models exhibit a puzzling inconsistency: they solve complex problems yet frequently fail on seemingly simpler ones. We investigate whether LLMs internally encode problem difficulty in a way that aligns with human judgment,…
In this paper, we study the existence of the transition densities of one-dimensional L\'evy processes. Compared with past results, our results contain the L\'evy processes whose L\'evy symbols have logarithm behavior at infinity. Our…
The theory of sparse stochastic processes offers a broad class of statistical models to study signals. In this framework, signals are represented as realizations of random processes that are solution of linear stochastic differential…