An Edge-Based Decomposition Framework for Temporal Networks

TL;DR

This work considers the problem of hierarchically decomposing the network and introduces an edge-based decomposition framework that unifies the core and truss decompositions for temporal networks while allowing us to consider the network's temporal dimension.

Abstract

A temporal network is a dynamic graph where every edge is assigned an integer time label that indicates at which discrete time step the edge is available. We consider the problem of hierarchically decomposing the network and introduce an edge-based decomposition framework that unifies the core and truss decompositions for temporal networks while allowing us to consider the network's temporal dimension. Based on our new framework, we introduce the $(k,Δ)$-core and $(k,Δ)$-truss decompositions, which are generalizations of the classic $k$-core and $k$-truss decompositions for multigraphs. Moreover, we show how $(k,Δ)$-cores and $(k,Δ)$-trusses can be efficiently further decomposed to obtain spatially and temporally connected components. We evaluate the characteristics of our new decompositions and the efficiency of our algorithms. Moreover, we demonstrate how our $(k,Δ)$-decompositions can be applied to analyze malicious content in a Twitter network to obtain insights that state-of-the-art baselines cannot obtain.

Figures (7)

• Figure 1: Example of our edge-based core decomposition.
• Figure 2: Examples of the $(k,\Delta)$-core and $(k,\Delta)$-truss decompositions and $\Delta$-connected components.
• Figure 3: Statistics of the $(k,\Delta_{50\%})$-cores, $(k,\Delta_{50\%})$-trusses, and $\Delta_{50\%}$-connected components of the $(k,\Delta_{50\%})$-cores.
• Figure 4: $(k,\Delta)$-truss decomposition
• Figure 5: $\Delta$-cc decomposition

Theorems & Definitions (15)

• Definition 1
• Theorem 1
• Definition 2
• Lemma 1
• Theorem 2
• Theorem 3
• Theorem 4
• Definition 3
• Lemma 2
• Theorem 5