Local Community Detection in Dynamic Networks
Daniel J. DiTursi, Gaurav Ghosh, Petko Bogdanov

TL;DR
This paper introduces PHASR, a novel framework for detecting dynamic communities in evolving networks by identifying active periods and community cores, significantly improving quality and efficiency over existing methods.
Contribution
It presents a scalable, spectral bound-based filtering approach and a time-aware hashing technique for effective dynamic community detection.
Findings
Communities detected are 2 to 67 times of higher quality than baselines.
The method prunes 55% to 95% of the search space, reducing computation time.
PHASR outperforms traditional static approaches in dynamic settings.
Abstract
Given a time-evolving network, how can we detect communities over periods of high internal and low external interactions? To address this question we generalize traditional local community detection in graphs to the setting of dynamic networks. Adopting existing static-network approaches in an "aggregated" graph of all temporal interactions is not appropriate for the problem as dynamic communities may be short-lived and thus lost when mixing interactions over long periods. Hence, dynamic community mining requires the detection of both the community nodes and an optimal time interval in which they are actively interacting. We propose a filter-and-verify framework for dynamic community detection. To scale to long intervals of graph evolution, we employ novel spectral bounds for dynamic community conductance and employ them to filter suboptimal periods in near-linear time. We also design…
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.
