اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMalliavin-Stein method for the multivariate compound Hawkes process
125
0
0.0
(
0
)
تأليف
Mahmoud Khabou
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we provide upper bounds on the d2 distance between a large class of functionals of a multivariate compound Hawkes process and a given Gaussian vector. This is proven using Malliavins calculus defined on an underlying Poisson embedding. The upper bound is then used to infer the speed of convergence of Central Limit Theorems for the multivariate compound Hawkes process with exponential kernels as the observation time T goes to infinity.
قيم البحث
اقرأ أيضاً
In this paper, following Nourdin-Peccatis methodology, we combine the Malliavin calculus and Steins method to provide general bounds on the Wasserstein distance between functionals of a compound Hawkes process and a given Gaussian density. To achieve
this, we rely on the Poisson embedding representation of an Hawkes process to provide a Malliavin calculus for the Hawkes processes, and more generally for compound Hawkes processes. As an application, we close a gap in the literature by providing the first Berry-Esseen bounds associated to Central Limit Theorems for the compound Hawkes process.
We combine Steins method with Malliavin calculus in order to obtain explicit bounds in the multidimensional normal approximation (in the Wasserstein distance) of functionals of Gaussian fields. Our results generalize and refine the main findings by P
eccati and Tudor (2005), Nualart and Ortiz-Latorre (2007), Peccati (2007) and Nourdin and Peccati (2007b, 2008); in particular, they apply to approximations by means of Gaussian vectors with an arbitrary, positive definite covariance matrix. Among several examples, we provide an application to a functional version of the Breuer-Major CLT for fields subordinated to a fractional Brownian motion.
We modify ETAS models by replacing the Pareto-like kernel proposed by Ogata with a Mittag-Leffler type kernel. Provided that the kernel decays as a power law with exponent $beta + 1 in (1,2]$, this replacement has the advantage that the Laplace trans
form of the Mittag-Leffler function is known explicitly, leading to simpler calculation of relevant quantities.
In the last decade, Hawkes processes have received a lot of attention as good models for functional connectivity in neural spiking networks. In this paper we consider a variant of this process, the Age Dependent Hawkes process, which incorporates ind
ividual post-jump behaviour into the framework of the usual Hawkes model. This allows to model recovery properties such as refractory periods, where the effects of the network are momentarily being suppressed or altered. We show how classical stability results for Hawkes processes can be improved by introducing age into the system. In particular, we neither need to a priori bound the intensities nor to impose any conditions on the Lipschitz constants. When the interactions between neurons are of mean field type, we study large network limits and establish the propagation of chaos property of the system.
We introduce a multivariate Hawkes process with constraints on its conditional density. It is a multivariate point process with conditional intensity similar to that of a multivariate Hawkes process but certain events are forbidden with respect to bo
undary conditions on a multidimensional constraint variable, whose evolution is driven by the point process. We study this process in the special case where the fertility function is exponential so that the process is entirely described by an underlying Markov chain, which includes the constraint variable. Some conditions on the parameters are established to ensure the ergodicity of the chain. Moreover, scaling limits are derived for the integrated point process. This study is primarily motivated by the stochastic modelling of a limit order book for high frequency financial data analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
