Span-core Decomposition for Temporal Networks: Algorithms and Applications

31 Jul 2020 Galimberti Edoardo Ciaperoni Martino Barrat Alain Bonchi Francesco Cattuto Ciro Gullo Francesco

When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their temporal span (i.e., the period of time for which the high density holds). In this paper we tackle this task by introducing a notion of temporal core decomposition where each core is associated with two quantities, its coreness, which quantifies how densely it is connected, and its span, which is a temporal interval: we call such cores \emph{span-cores}... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • SOCIAL AND INFORMATION NETWORKS
  • PHYSICS AND SOCIETY