ﻻ يوجد ملخص باللغة العربية
The Ornstein-Uhlenbeck process can be seen as a paradigm of a finite-variance and statistically stationary rough random walk. Furthermore, it is defined as the unique solution of a Markovian stochastic dynamics and shares the same local regularity as the one of the Brownian motion. Based on previous works, we propose to include in the framework of one of its generalization, the so-called fractional Ornstein-Uhlenbeck process, some Multifractal corrections, using a Gaussian Multiplicative Chaos. The aforementioned process, called a Multifractal fractional Ornstein-Uhlenbeck process, is a statistically stationary finite-variance process. Its underlying dynamics is non-Markovian, although non-anticipating and causal. The numerical scheme and theoretical approach are based on a regularization procedure, that gives a meaning to this dynamical evolution, which unique solution converges towards a well-behaved stochastic process.
Tempered fractional Brownian motion is revisited from the viewpoint of reduced fractional Ornstein-Uhlenbeck process. Many of the basic properties of the tempered fractional Brownian motion can be shown to be direct consequences or modifications of t
The paper is concerned with the properties of solutions to linear evolution equation perturbed by cylindrical Levy processes. It turns out that solutions, under rather weak requirements, do not have c`adl`ag modification. Some natural open questions are also stated.
This paper addresses the problem of estimating drift parameter of the Ornstein - Uhlenbeck type process, driven by the sum of independent standard and fractional Brownian motions. The maximum likelihood estimator is shown to be consistent and asympto
In this paper, we study the asymptotic behavior of a supercritical $(xi,psi)$-superprocess $(X_t)_{tgeq 0}$ whose underlying spatial motion $xi$ is an Ornstein-Uhlenbeck process on $mathbb R^d$ with generator $L = frac{1}{2}sigma^2Delta - b x cdot a
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm so-called Walk on Moving Spheres was already introduced in the Brownian context. The aim is therefore to g