相关论文: The coding complexity of L\'evy processes
Sparse coding consists in representing signals as sparse linear combinations of atoms selected from a dictionary. We consider an extension of this framework where the atoms are further assumed to be embedded in a tree. This is achieved…
We establish distributional limit theorems for the shape statistics of a concave majorant (i.e. the fluctuations of its length, its supremum, the time it is attained and its value at $T$) of any L\'evy process on $[0,T]$ as $T\to\infty$.…
This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…
We prove simple general formulas for expectations of functions of a L\'evy process and its running extremum. Under additional conditions, we derive analytical formulas using the Fourier/Laplace inversion and Wiener-Hopf factorization, and…
In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source…
In this article we consider the Levy processes and the corresponding semigroup. We represent the generator of this semigroup in a convolution form. Using the obtained convolution form and the theory of integral equations we investigate the…
While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the…
We convert, within polynomial-time and sequential processing, an NP-Complete Problem into a real-variable problem of minimizing a sum of Rational Linear Functions constrained by an Asymptotic-Linear-Program. The coefficients and constants…
In this work, we investigate the fine regularity of L\'evy processes using the 2-microlocal formalism. This framework allows us to refine the multifractal spectrum determined by Jaffard and, in addition, study the oscillating singularities…
Gaussian processes are rich distributions over functions, with generalization properties determined by a kernel function. When used for long-range extrapolation, predictions are particularly sensitive to the choice of kernel parameters. It…
Motivated by applications to the study of L-functions, we develop an asymptotic version of the large sieve inequality for linear forms in primitive Dirichlet characters.
Sparse representation has been applied successfully in abnormal event detection, in which the baseline is to learn a dictionary accompanied by sparse codes. While much emphasis is put on discriminative dictionary construction, there are no…
For $n$ equidistant observations of a L\'evy process at time distance $\Delta_n$ we consider the problem of testing hypotheses on the volatility, the jump measure and its Blumenthal-Getoor index in a non- or semiparametric manner.…
In this paper we study $L_p$-norm spherical copulas for arbitrary $p \in [1,\infty]$ and arbitrary dimensions. The study is motivated by a conjecture that these distributions lead to a sharp bound for the value of a certain generalized mean…
In this paper, we study nonparametric estimation of the L\'{e}vy density for L\'{e}vy processes, with and without Brownian component. For this, we consider $n$ discrete time observations with step $\Delta$. The asymptotic framework is: $n$…
We establish large deviation principle (LDP) for the family of vector-valued random processes $(X^\epsilon,Y^\epsilon),\epsilon\to 0$ defined as $$ X^\epsilon_t=\frac{1}{\epsilon^\kappa}\int_0^t H(\xi^\epsilon_s,Y^\epsilon_s)ds,…
We consider periodic homogenization problems for the L{\'e}vy operators with asymmetric L{\'e}vy densities. The formal asymptotic expansion used for the $\a$-stable (symmetric) L{\'e}vy operators ($\a\in (0,2)$) is not applicable directly…
A general method of source coding over expansion is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued source) to a set of much simpler problems, compressing discrete sources.…
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…
In this paper we establish functional Erd\H{o}s-Renyi laws for L\'evy processes, i.e. limit theorems for sets of functions on [0,1] associated to their increments. First, we determine precise conditions under which, in a general framework,…