اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAge Dependent Hawkes Process
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 individual 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 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 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.
Ulam has defined a history-dependent random sequence of integers by the recursion $X_{n+1}$ $= X_{U(n)}+X_{V(n)}, n geqslant r$ where $U(n)$ and $V(n)$ are independently and uniformly distributed on ${1,dots,n}$, and the initial sequence, $X_1=x_1,do
ts,X_r=x_r$, is fixed. We consider the asymptotic properties of this sequence as $n to infty$, showing, for example, that $n^{-2} sum_{k=1}^n X_k$ converges to a non-degenerate random variable. We also consider the moments and auto-covariance of the process, showing, for example, that when the initial condition is $x_1 =1$ with $r =1$, then $lim_{nto infty} n^{-2} E X^2_n = (2 pi)^{-1} sinh(pi)$; and that for large $m < n$, we have $(m n)^{-1} E X_m X_n doteq (3 pi)^{-1} sinh(pi).$ We further consider new random adding processes where changes occur independently at discrete times with probability $p$, or where changes occur continuously at jump times of an independent Poisson process. The processes are shown to have properties similar to those of the discrete time process with $p=1$, and to be readily generalised to a wider range of related sequences.
In this work, we study the event occurrences of user activities on online social network platforms. To characterize the social activity interactions among network users, we propose a network group Hawkes (NGH) process model. Particularly, the observe
d network structure information is employed to model the users dynamic posting behaviors. Furthermore, the users are clustered into latent groups according to their dynamic behavior patterns. To estimate the model, a constraint maximum likelihood approach is proposed. Theoretically, we establish the consistency and asymptotic normality of the estimators. In addition, we show that the group memberships can be identified consistently. To conduct estimation, a branching representation structure is firstly introduced, and a stochastic EM (StEM) algorithm is developed to tackle the computational problem. Lastly, we apply the proposed method to a social network data collected from Sina Weibo, and identify the infuential network users as an interesting application.
Traditionally, Hawkes processes are used to model time--continuous point processes with history dependence. Here we propose an extended model where the self--effects are of both excitatory and inhibitory type and follow a Gaussian Process. Whereas pr
evious work either relies on a less flexible parameterization of the model, or requires a large amount of data, our formulation allows for both a flexible model and learning when data are scarce. We continue the line of work of Bayesian inference for Hawkes processes, and our approach dispenses with the necessity of estimating a branching structure for the posterior, as we perform inference on an aggregated sum of Gaussian Processes. Efficient approximate Bayesian inference is achieved via data augmentation, and we describe a mean--field variational inference approach to learn the model parameters. To demonstrate the flexibility of the model we apply our methodology on data from three different domains and compare it to previously reported results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
