A Comparative Study of Some Point Process Models for Dynamic Networks

Modeling dynamic networks has attracted much interest in recent years, which helps understand networks’ behavior. Many works have been dedicated to modeling discrete‐time networks, but less work is done for continuous‐time networks. Point processes as powerful tools for modeling discrete events in continuous time have been widely used for modeling events over networks and their dynamics. These models have solid mathematical assumptions, making them interpretable but decreasing their generalizability for different datasets. Hence, neural point processes were introduced that don’t have strong assumptions on generative functions. However, these models can be impractical in the case of a large number of event types. This research presents a comparative study of different point process (Hawkes) models for continuous‐time networks. Furthermore, a previously introduced neural point process (neural Hawkes) model is applied for modeling network interactions. In this work, network clustering is used for specifying interaction types. These methods are compared using different synthetic and real‐world datasets, and their efficiency is evaluated on these datasets. The experiments represent that each model is appropriate for a group of datasets. In addition, the effect of clustering on results is discussed, and experiments for different clusters are presented.