Temporal network compression via network hashing

• URL: http://arxiv.org/abs/2307.04890v1
• Date: Mon, 10 Jul 2023 20:25:41 GMT
• Title: Temporal network compression via network hashing
• Authors: R\'emi Vaudaine, Pierre Borgnat, Paulo Goncalves, R\'emi Gribonval and M\'arton Karsai
• Abstract summary: We propose an efficient matrix algorithm to tackle the problem of representing temporal networks. Secondly, we propose a hashing framework to coarsen large temporal networks into smaller proxies on which out-components are easier to estimate. Our graph hashing solution has implications in privacy respecting representation of temporal networks.
• Score: 3.708135408284268
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pairwise temporal interactions between entities can be represented as temporal networks, which code the propagation of processes such as epidemic spreading or information cascades, evolving on top of them. The largest outcome of these processes is directly linked to the structure of the underlying network. Indeed, a node of a network at given time cannot affect more nodes in the future than it can reach via time-respecting paths. This set of nodes reachable from a source defines an out-component, which identification is costly. In this paper, we propose an efficient matrix algorithm to tackle this issue and show that it outperforms other state-of-the-art methods. Secondly, we propose a hashing framework to coarsen large temporal networks into smaller proxies on which out-components are easier to estimate, and then recombined to obtain the initial components. Our graph hashing solution has implications in privacy respecting representation of temporal networks.

Related papers

• Multi-perspective Memory Enhanced Network for Identifying Key Nodes in Social Networks [51.54002032659713]
  We propose a novel Multi-perspective Memory Enhanced Network (MMEN) for identifying key nodes in social networks. MMEN mines key nodes from multiple perspectives and utilizes memory networks to store historical information. Our method significantly outperforms previous methods.
  arXiv  Detail & Related papers  (2024-03-22T14:29:03Z)
• DANI: Fast Diffusion Aware Network Inference with Preserving Topological Structure Property [2.8948274245812327]
  We propose a novel method called DANI to infer the underlying network while preserving its structural properties. DANI has higher accuracy and lower run time while maintaining structural properties, including modular structure, degree distribution, connected components, density, and clustering coefficients.
  arXiv  Detail & Related papers  (2023-10-02T23:23:00Z)
• A Learning Based Scheme for Fair Timeliness in Sparse Gossip Networks [41.53961199878831]
  We consider a gossip network, consisting of $n$ nodes, which tracks the information at a source. The source updates its information with a Poisson arrival process and also sends updates to the nodes in the network. Some nodes are able to track the source very timely, whereas, some nodes fall behind versions quite often.
  arXiv  Detail & Related papers  (2023-10-02T17:55:17Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• 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)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• Spatiotemporal Graph Neural Network based Mask Reconstruction for Video Object Segmentation [70.97625552643493]
  This paper addresses the task of segmenting class-agnostic objects in semi-supervised setting. We propose a novel graph neuralS network (TG-Net) which captures the local contexts by utilizing all proposals.
  arXiv  Detail & Related papers  (2020-12-10T07:57:44Z)
• 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)
• Online Dynamic Network Embedding [26.203786679460528]
  We propose an algorithm Recurrent Neural Network Embedding (RNNE) to deal with dynamic network. RNNE takes into account both static and dynamic characteristics of the network. We evaluate RNNE on five networks and compare with several state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2020-06-30T02:21:37Z)
• ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
  We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
  arXiv  Detail & Related papers  (2020-06-28T23:09:27Z)
• Temporal Network Representation Learning via Historical Neighborhoods Aggregation [28.397309507168128]
  We propose the Embedding via Historical Neighborhoods Aggregation (EHNA) algorithm. We first propose a temporal random walk that can identify relevant nodes in historical neighborhoods. Then we apply a deep learning model which uses a custom attention mechanism to induce node embeddings.
  arXiv  Detail & Related papers  (2020-03-30T04:18:48Z)

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.