Discovering Dense Correlated Subgraphs in Dynamic Networks
Lists
Only you see this
Abstract
Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal subgraphs that satisfy specific density and similarity thresholds. To measure the similarity of the temporal behavior, we use the correlation between the binary time series that represent the activity of the edges. For the density, we study two variants based on the average degree. For these problem variants we enumerate the maximal subgraphs and compute a compact subset of subgraphs that have limited overlap. We propose an approximate algorithm that scales well with the size of the network, while achieving a high accuracy. We evaluate our framework on both real and synthetic datasets. The results of the synthetic data demonstrate the high accuracy of the approximation and show the scalability of the framework.
BibTeX
@inproceedings{preti2021discovering,
author = {Giulia Preti and Polina Rozenshtein and Aristides Gionis and Yannis Velegrakis},
title = {{Discovering Dense Correlated Subgraphs in Dynamic Networks}},
booktitle = {PAKDD},
year = {2021},
doi = {10.1007/978-3-030-75762-5\_32},
}| Finding events in temporal networks: segmentation meets densest subgraph discovery | Knowledge and Information Systems · 2020 |
| Scalable Algorithm for Dynamic Quasi-clique Detection | arXiv · 2026 |
| Mining Heavy Temporal Subgraphs: Fast Algorithms and Applications | AAAI · 2018 |
| Best Friends Forever (BFF): Finding Lasting Dense Subgraphs | arXiv · 2016 |
| Temporal k-Core Query, Revisited. | arXiv · 2025 |
| Fully Dynamic Algorithm for Top-k Densest Subgraphs | arXiv · 2016 |