SimHawNet: A Modified Hawkes Process for Temporal Network Simulation

• URL: http://arxiv.org/abs/2203.07260v3
• Date: Thu, 16 Jan 2025 13:40:01 GMT
• Title: SimHawNet: A Modified Hawkes Process for Temporal Network Simulation
• Authors: Mathilde Perez, Raphaël Romero, Bo Kang, Tijl De Bie, Jefrey Lijffijt, Charlotte Laclau,
• Abstract summary: We propose a new framework for generative models of continuous-time temporal networks.<n>SimHawNet enables simulation of the evolution of temporal networks in continuous time.
• Score: 12.403827785443928
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Temporal networks allow representing connections between objects while incorporating the temporal dimension. While static network models can capture unchanging topological regularities, they often fail to model the effects associated with the causal generative process of the network that occurs in time. Hence, exploiting the temporal aspect of networks has been the focus of many recent studies. In this context, we propose a new framework for generative models of continuous-time temporal networks. We assume that the activation of the edges in a temporal network is driven by a specified temporal point process. This approach allows to directly model the waiting time between events while incorporating time-varying history-based features as covariates in the predictions. Coupled with a thinning algorithm designed for the simulation of point processes, SimHawNet enables simulation of the evolution of temporal networks in continuous time. Finally, we introduce a comprehensive evaluation framework to assess the performance of such an approach, in which we demonstrate that SimHawNet successfully simulates the evolution of networks with very different generative processes and achieves performance comparable to the state of the art, while being significantly faster.

Related papers

• Continuous-time Graph Representation with Sequential Survival Process [0.17265013728931003]
  We propose a process relying on survival functions to model the durations of links and their absences over time. GraSSP: Graph Representation with Sequential Survival Process forms a generic new likelihood explicitly accounting for intermittent edge-persistent networks. We quantitatively assess the developed framework in various downstream tasks, such as link prediction and network completion.
  arXiv  Detail & Related papers  (2023-12-20T14:46:54Z)
• An Adaptive Framework for Generalizing Network Traffic Prediction towards Uncertain Environments [51.99765487172328]
  We have developed a new framework using time-series analysis for dynamically assigning mobile network traffic prediction models. Our framework employs learned behaviors, outperforming any single model with over a 50% improvement relative to current studies.
  arXiv  Detail & Related papers  (2023-11-30T18:58:38Z)
• How neural networks learn to classify chaotic time series [77.34726150561087]
  We study the inner workings of neural networks trained to classify regular-versus-chaotic time series. We find that the relation between input periodicity and activation periodicity is key for the performance of LKCNN models.
  arXiv  Detail & Related papers  (2023-06-04T08:53:27Z)
• A Generic Approach to Integrating Time into Spatial-Temporal Forecasting via Conditional Neural Fields [1.7661845949769062]
  This paper presents a general approach to integrating the time component into forecasting models. The main idea is to employ conditional neural fields to represent the auxiliary features extracted from the time component. Experiments on road traffic and cellular network traffic datasets prove the effectiveness of the proposed approach.
  arXiv  Detail & Related papers  (2023-05-11T14:20:23Z)
• Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs [51.51417735550026]
  Methods for machine learning on temporal networks generally exhibit at least one of two limitations. We present a simple method that avoids both shortcomings: construct the line graph of the network, which includes a node for each interaction, and weigh the edges of this graph based on the difference in time between interactions. Empirical results on real-world networks demonstrate our method's efficacy and efficiency on both edge classification and temporal link prediction.
  arXiv  Detail & Related papers  (2022-09-30T18:24:13Z)
• Generating fine-grained surrogate temporal networks [12.7211231166069]
  We propose a novel and simple method for generating surrogate temporal networks. Our method decomposes the input network into star-like structures evolving in time. Then those structures are used as building blocks to generate a surrogate temporal network.
  arXiv  Detail & Related papers  (2022-05-18T09:38:22Z)
• Temporal Relevance Analysis for Video Action Models [70.39411261685963]
  We first propose a new approach to quantify the temporal relationships between frames captured by CNN-based action models. We then conduct comprehensive experiments and in-depth analysis to provide a better understanding of how temporal modeling is affected.
  arXiv  Detail & Related papers  (2022-04-25T19:06:48Z)
• Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
  Time series data are ubiquitous in several domains as climate, economics and health care. Recent conceptual approach relies on time series mapping to complex networks. Network analysis can be used to characterize different types of time series.
  arXiv  Detail & Related papers  (2021-10-11T13:46:28Z)
• Probabilistic Time Series Forecasting with Implicit Quantile Networks [0.7249731529275341]
  We combine an autoregressive recurrent neural network to model temporal dynamics with Implicit Quantile Networks to learn a large class of distributions over a time-series target. Our approach is favorable in terms of point-wise prediction accuracy as well as on estimating the underlying temporal distribution.
  arXiv  Detail & Related papers  (2021-07-08T10:37:24Z)
• Spatio-temporal Modeling for Large-scale Vehicular Networks Using Graph Convolutional Networks [110.80088437391379]
  A graph-based framework called SMART is proposed to model and keep track of the statistics of vehicle-to-temporal (V2I) communication latency across a large geographical area. We develop a graph reconstruction-based approach using a graph convolutional network integrated with a deep Q-networks algorithm. Our results show that the proposed method can significantly improve both the accuracy and efficiency for modeling and the latency performance of large vehicular networks.
  arXiv  Detail & Related papers  (2021-03-13T06:56:29Z)
• Radflow: A Recurrent, Aggregated, and Decomposable Model for Networks of Time Series [77.47313102926017]
  Radflow is a novel model for networks of time series that influence each other. It embodies three key ideas: a recurrent neural network to obtain node embeddings that depend on time, the aggregation of the flow of influence from neighboring nodes with multi-head attention, and the multi-layer decomposition of time series. We show that Radflow can learn different trends and seasonal patterns, that it is robust to missing nodes and edges, and that correlated temporal patterns among network neighbors reflect influence strength.
  arXiv  Detail & Related papers  (2021-02-15T00:57:28Z)
• Synergetic Learning of Heterogeneous Temporal Sequences for Multi-Horizon Probabilistic Forecasting [48.8617204809538]
  We propose Variational Synergetic Multi-Horizon Network (VSMHN), a novel deep conditional generative model. To learn complex correlations across heterogeneous sequences, a tailored encoder is devised to combine the advances in deep point processes models and variational recurrent neural networks. Our model can be trained effectively using variational inference and generates predictions with Monte-Carlo simulation.
  arXiv  Detail & Related papers  (2021-01-31T11:00:55Z)
• PRESTO: Simple and Scalable Sampling Techniques for the Rigorous Approximation of Temporal Motif Counts [7.025709586759655]
  We present an efficient and scalable algorithm to obtain rigorous approximations of the count of temporal motifs. Our algorithm is based on a simple but effective sampling approach, which renders our algorithm practical for very large datasets.
  arXiv  Detail & Related papers  (2021-01-18T16:35:12Z)
• EPNE: Evolutionary Pattern Preserving Network Embedding [26.06068388979255]
  We propose EPNE, a temporal network embedding model preserving evolutionary patterns of the local structure of nodes. With the adequate modeling of temporal information, our model is able to outperform other competitive methods in various prediction tasks.
  arXiv  Detail & Related papers  (2020-09-24T06:31:14Z)
• Online Estimation and Community Detection of Network Point Processes for Event Streams [12.211623200731788]
  A common goal in network modeling is to uncover the latent community structure present among nodes. We propose a fast online variational inference algorithm for estimating the latent structure underlying dynamic event arrivals on a network. We demonstrate that online inference can obtain comparable performance, in terms of community recovery, to non-online variants.
  arXiv  Detail & Related papers  (2020-09-03T15:39:55Z)
• TempNodeEmb:Temporal Node Embedding considering temporal edge influence matrix [0.8941624592392746]
  Predicting future links among the nodes in temporal networks reveals an important aspect of the evolution of temporal networks. Some approaches consider a simplified representation of temporal networks but in high-dimensional and generally sparse matrices. We propose a new node embedding technique which exploits the evolving nature of the networks considering a simple three-layer graph neural network at each time step.
  arXiv  Detail & Related papers  (2020-08-16T15:39:07Z)
• Supporting Optimal Phase Space Reconstructions Using Neural Network Architecture for Time Series Modeling [68.8204255655161]
  We propose an artificial neural network with a mechanism to implicitly learn the phase spaces properties. Our approach is either as competitive as or better than most state-of-the-art strategies.
  arXiv  Detail & Related papers  (2020-06-19T21:04:47Z)
• Liquid Time-constant Networks [117.57116214802504]
  We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system's dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations.
  arXiv  Detail & Related papers  (2020-06-08T09:53:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.