相关论文: Efficient evaluation of expectations of functions …

Maximum likelihood estimations for the parameters of extreme value distributions are discussed in this paper using fixed point iteration. The commonly used numerical approach for addressing this problem is the Newton-Raphson approach which…

Using complex analysis techniques we obtain precise asymptotic approximations for the kernels corresponding to the symmetric $\alpha$-stable processes and their fractional derivatives. We apply our method to general L\'evy processes whose…

We consider the problem of estimating the fractional order of a L\'{e}vy process from low frequency historical and options data. An estimation methodology is developed which allows us to treat both estimation and calibration problems in a…

This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve various optimization problem setups. We propose a proximally…

Suppose we observe an invertible linear process with independent mean-zero innovations and with coefficients depending on a finite-dimensional parameter, and we want to estimate the expectation of some function under the stationary…

Distribution functions of many static transport equations are found using the Maximum Entropy Principle. The equations of constraint which contain the relevant dynamical information are simply the low-lying moments of the distributions.…

This paper presents a probabilistic perspective on iterative methods for approximating the solution $\mathbf{x}_* \in \mathbb{R}^d$ of a nonsingular linear system $\mathbf{A} \mathbf{x}_* = \mathbf{b}$. In the approach a standard iterative…

In this paper, we propose a dynamical systems perspective of the Expectation-Maximization (EM) algorithm. More precisely, we can analyze the EM algorithm as a nonlinear state-space dynamical system. The EM algorithm is widely adopted for…

Random processes play a crucial role in scientific research, often characterized by distribution functions or probability density functions (PDFs). These PDFs serve as essential approximations of the actual and frequently undisclosed…

Several long-time limit theorems of one-dimensional L\'evy processes weighted and normalized by functions of its supremum are studied. The long-time limits are taken via the families of exponential times and that of constant times, called…

Upper estimates of densities of convolution semigroups of probability measures are given under explicit assumptions on the corresponding L\'evy measure and the L\'evy--Khinchin exponent.

We study a Monte Carlo algorithm for simulation of probability distributions based on stochastic step functions, and compare to the traditional Metropolis/Hastings method. Unlike the latter, the step function algorithm can produce an…

The one dimensional distribution of a L\'{e}vy process is not known in general even though its characteristic function is given by the famous L\'{e}vy-Khinchine theorem. This article gives an exact series representation for the one…

Algorithms for signal recovery in compressed sensing (CS) are often improved by stabilization techniques, such as damping, or the less widely known so-called fractional approach, which is based on the expectation propagation (EP) framework.…

We construct superharmonic functions and give sharp bounds for the expected exit time and probability of survival for isotropic unimodal L\'evy processes

In this paper, we provide strong $L_2$-rates of approximation of the integral-type functionals of Markov processes by integral sums. We improve the method developed in [2]. Under assumptions on the process formulated only in terms of its…

The purpose of this paper is to adapt the empirical characteristic function (ECF) method to stable, but possibly not inverse stable linear stochastic system driven by the increments of a Levy-process. A remarkable property of the ECF method…

Signal processing techniques will lean on blind methods in the near future, where no redundant, resource allocating information will be transmitted through the channel. To achieve a proper decision, however, it is essential to know at least…

It is shown that a certain functional of a branching process has representations in terms of both a maximisation problem and a minimisation problem. A consequence of these representation is that upper and lower bounds on the functional can…

The paper is devoted to the development of control procedures with a guide for conflict-controlled dynamical systems described by ordinary fractional differential equations with the Caputo derivative of an order $\alpha \in (0, 1).$ For the…