返回
Group Network Hawkes Process
DOI:10.1080/01621459.2023.2257889.png)
摘要
En 中文
In this work, we study the event occurrences of individuals interacting in a network. To characterize the dynamic interactions among the individuals, we propose a group network Hawkes process (GNHP) model whose network structure is observed and fixed. In particular, we introduce a latent group structure among individuals to account for the heterogeneous user-specific characteristics. A maximum likelihood approach is proposed to simultaneously cluster individuals in the network and estimate model parameters. A fast EM algorithm is subsequently developed by using the branching representation of the proposed GNHP model. Theoretical properties of the resulting estimators of group memberships and model parameters are investigated under both settings when the number of latent groups G is over-specified or correctly specified. A data-driven criterion that can consistently identify the true G under mild conditions is derived. Extensive simulation studies and an application to a dataset collected from Sina Weibo are used to illustrate the effectiveness of the proposed methodology. Supplementary materials for this article are available online.
Keyword:
EM algorithm
Latent group structure
Multivariate Hawkes process
Network data analysis
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
CONSISTENCY OF COMMUNITY DETECTION IN NETWORKS UNDER DEGREE-CORRECTED STOCHASTIC BLOCK MODELS
ANNALS OF STATISTICS
IF3.7

