اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn aggregated model for Karlin stable processes
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An aggregated model is proposed, of which the partial-sum process scales to the Karlin stable processes recently investigated in the literature. The limit extremes of the proposed model, when having regularly-varying tails, are characterized by the convergence of the corresponding point processes. The proposed model is an extension of an aggregated model proposed by Enriquez (2004) in order to approximate fractional Brownian motions with Hurst index $Hin(0,1/2)$, and is of a different nature of the other recently investigated Karlin models which are essentially based on infinite urn schemes.
قيم البحث
اقرأ أيضاً
We consider a new family of $R^d$-valued L{e}vy processes that we call Lamperti stable. One of the advantages of this class is that the law of many related functionals can be computed explicitely (see for instance cite{cc}, cite{ckp}, cite{kp} and ci
te{pp}). This family of processes shares many properties with the tempered stable and the layered stable processes, defined in Rosinski cite{ro} and Houdre and Kawai cite{hok} respectively, for instance their short and long time behaviour. Additionally, in the real valued case we find a series representation which is used for sample paths simulation. In this work we find general properties of this class and we also provide many examples, some of which appear in recent literature.
Using a generalization of the skew-product representation of planar Brownian motion and the analogue of Spitzers celebrated asymptotic Theorem for stable processes due to Bertoin and Werner, for which we provide a new easy proof, we obtain some limit
Theorems for the exit time from a cone of stable processes of index $alphain(0,2)$. We also study the case $trightarrow0$ and we prove some Laws of the Iterated Logarithm (LIL) for the (well-defined) winding process associated to our planar stable process.
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
bla$ where $sigma, b >0$; and whose branching mechanism $psi$ satisfies Greys condition and some perturbation condition which guarantees that, when $zto 0$, $psi(z)=-alpha z + eta z^{1+beta} (1+o(1))$ with $alpha > 0$, $eta>0$ and $betain (0, 1)$. Some law of large numbers and $(1+beta)$-stable central limit theorems are established for $(X_t(f) )_{tgeq 0}$, where the function $f$ is assumed to be of polynomial growth. A phase transition arises for the central limit theorems in the sense that the forms of the central limit theorem are different in three different regimes corresponding the branching rate being relatively small, large or critical at a balanced value.
This paper is a continuation of our recent paper (Elect. J. Probab. 24 (2019), no. 141) and is devoted to the asymptotic behavior of a class of supercritical super Ornstein-Uhlenbeck processes $(X_t)_{tgeq 0}$ with branching mechanisms of infinite se
cond moment. In the aforementioned paper, we proved stable central limit theorems for $X_t(f) $ for some functions $f$ of polynomial growth in three different regimes. However, we were not able to prove central limit theorems for $X_t(f) $ for all functions $f$ of polynomial growth. In this note, we show that the limit stable random variables in the three different regimes are independent, and as a consequence, we get stable central limit theorems for $X_t(f) $ for all functions $f$ of polynomial growth.
We exhibit an exact simulation algorithm for the supremum of a stable process over a finite time interval using dominated coupling from the past (DCFTP). We establish a novel perpetuity equation for the supremum (via the representation of the concave
majorants of Levy processes) and apply it to construct a Markov chain in the DCFTP algorithm. We prove that the number of steps taken backwards in time before the coalescence is detected is finite. We analyse numerically the performance of the algorithm (the code, written in Julia 1.0, is available on GitHub).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
