اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRenewal in Hawkes processes with self-excitation and inhibition
82
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper investigates Hawkes processes on the positive real line exhibiting both self-excitation and inhibition. Each point of this point process impacts its future intensity by the addition of a signed reproduction function. The case of a nonnegative reproduction function corresponds to self-excitation, and has been widely investigated in the literature. In particular, there exists a cluster representation of the Hawkes process which allows to apply results known for Galton-Watson trees. In the present paper, we establish limit theorems for Hawkes process with signed reproduction functions by using renewal techniques. We notably prove exponential concentration inequalities, and thus extend results of Reynaud-Bouret and Roy (2007) which were proved for nonnegative reproduction functions using this cluster representation which is no longer valid in our case. An important step for this is to establish the existence of exponential moments for renewal times of M/G/infinity queues that appear naturally in our problem. These results have their own interest, independently of the original problem for the Hawkes processes.
قيم البحث
اقرأ أيضاً
In this paper we consider some non linear Hawkes processes with signed reproduction function (or memory kernel) thus exhibiting both self-excitation and inhibition. We provide a Law of Large Numbers, a Central Limit Theorem and large deviation result
s, as time growths to infinity. The proofs lie on a renewal structure for these processes introduced in Costa et al. (2020) which leads to a comparison with cumulative processes. Explicit computations are made on some examples. Similar results have been obtained in the literature for self-exciting Hawkes processes only.
We review the theory of renewal reward processes, which describes renewal processes that have some cost or reward associated with each cycle. We present a new simplified proof of the renewal reward theorem that mimics the proof of the elementary rene
wal theorem and avoids the technicalities in the proof that is presented in most textbooks. Moreover, we mention briefly the extension of the theory to partial rewards, where it is assumed that rewards are not accrued only at renewal epochs but also during the renewal cycle. For this case, we present a counterexample which indicates that the standard conditions for the renewal reward theorem are not sufficient; additional regularity assumptions are necessary. We present a few examples to indicate the usefulness of this theory, where we prove the inspection paradox and Littles law through the renewal reward theorem.
Asynchronous events on the continuous time domain, e.g., social media actions and stock transactions, occur frequently in the world. The ability to recognize occurrence patterns of event sequences is crucial to predict which typeof events will happen
next and when. A de facto standard mathematical framework to do this is the Hawkes process. In order to enhance expressivity of multivariate Hawkes processes, conventional statistical methods and deep recurrent networks have been employed to modify its intensity function. The former is highly interpretable and requires small size of training data but relies on correct model design while the latter has less dependency on prior knowledge and is more powerful in capturing complicated patterns. We leverage pros and cons of these models and propose a self-attentive Hawkes process(SAHP). The proposed method adapts self-attention to fit the intensity function of Hawkes processes. This design has two benefits:(1) compared with conventional statistical methods, the SAHP is more powerful to identify complicated dependency relationships between temporal events; (2)compared with deep recurrent networks, the self-attention mechanism is able to capture longer historical information, and is more interpretable because the learnt attention weight tensor shows contributions of each historical event. Experiments on four real-world datasets demonstrate the effectiveness of the proposed method.
We consider the problem of determining escape probabilities from an interval of a general compound renewal process with drift. This problem is reduced to the solution of a certain integral equation. In an actuarial situation where only negative jumps
arise we give a general solution for escape and survival probabilities under Erlang$(n)$ and hypo-exponential arrivals. These ideas are generalized to the class of arrival distributions having rational Laplace transforms. In a general situation with two-sided jumps we also identify important families of solvable cases. A parallelism with the scale function of diffusion processes is drawn.
We refine some previous results concerning the Renewal Contact Processes. We significantly widen the family of distributions for the interarrival times for which the critical value can be shown to be strictly positive. The result now holds for any sp
atial dimension $d geq 1$ and requires only a moment condition slightly stronger than finite first moment. We also prove a Complete Convergence Theorem for heavy tailed interarrival times. Finally, for heavy tailed distributions we examine when the contact process, conditioned on survival, can be asymptotically predicted knowing the renewal processes. We close with an example of an interarrival time distribution attracted to a stable law of index 1 for which the critical value vanishes, a tail condition uncovered by previous results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
