Provenance in Temporal Interaction Networks

In temporal interaction networks, vertices correspond to entities, which exchange data quantities (e.g., money, bytes, messages) over time. Tracking the origin of data that have reached a given vertex at any time can help data analysts to understand the reasons behind the accumulated quantity at the vertex or behind the interactions between entities. In this paper, we study data provenance in a temporal interaction network. We investigate alternative propagation models that may apply to different application scenarios. For each such model, we propose annotation mechanisms that track the origin of propagated data in the network and the routes of data quantities. Besides analyzing the space and time complexity of these mechanisms, we propose techniques that reduce their cost in practice, by either (i) limiting provenance tracking to a subset of vertices or groups of vertices, or (ii) tracking provenance only for quantities that were generated in the near past or limiting the provenance data in each vertex by a budget constraint. Our experimental evaluation on five real datasets shows that quantity propagation models based on generation time or receipt order scale well on large graphs; on the other hand, a model that propagates quantities proportionally has high space and time requirements and can benefit from the aforementioned cost reduction techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2020

Flow Computation in Temporal Interaction Networks

Temporal interaction networks capture the history of activities between ...
research
04/16/2018

Models for Capturing Temporal Smoothness in Evolving Networks for Learning Latent Representation of Nodes

In a dynamic network, the neighborhood of the vertices evolve across dif...
research
05/17/2018

Deleting edges to restrict the size of an epidemic in temporal networks

A variety of potentially disease-spreading contact networks can be natur...
research
06/24/2023

A Dynamic Data Structure for Representing Timed Transitive Closures on Disk

Temporal graphs represent interactions between entities over time. These...
research
03/02/2015

Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation

Massive graphs, such as online social networks and communication network...
research
07/31/2013

A Time and Space Efficient Junction Tree Architecture

The junction tree algorithm is a way of computing marginals of boolean m...
research
04/28/2021

Information Interaction Profile of Choice Adoption

Interactions between pieces of information (entities) play a substantial...

Please sign up or login with your details

Forgot password? Click here to reset