Mining (maximal) span-cores from temporal networks
Edoardo Galimberti, Alain Barrat, Francesco Bonchi, Ciro Cattuto,, Francesco Gullo

TL;DR
This paper introduces efficient algorithms for identifying maximal span-cores in temporal networks, enabling the analysis of dense, time-bound structures crucial for understanding social dynamics and detecting anomalies.
Contribution
It presents novel algorithms for computing all span-cores and specifically the maximal span-cores efficiently, leveraging containment properties and theoretical insights.
Findings
Algorithms are efficient and scalable on real-world data.
Maximal span-cores effectively reveal social dynamics.
Applications include anomaly detection in face-to-face interaction networks.
Abstract
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). We tackle this task by introducing a notion of temporal core decomposition where each core is associated with its span: we call such cores span-cores. As the total number of time intervals is quadratic in the size of the temporal domain under analysis, the total number of span-cores is quadratic in as well. Our first contribution is an algorithm that, by exploiting containment properties among span-cores, computes all the span-cores efficiently. Then, we focus on the problem of finding only the maximal span-cores, i.e., span-cores that are not dominated by any other span-core by both the coreness property and the span. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
