Online detection of temporal communities in evolving networks by estrangement confinement
Vikas Kawadia, Sameet Sreenivasan

TL;DR
This paper introduces a novel method called estrangement confinement for detecting temporal communities in evolving networks, emphasizing the importance of temporal smoothness and node relationship inertia to improve community detection accuracy.
Contribution
The paper proposes a new measure of partition distance called estrangement and integrates it into community detection, enabling more reliable identification of temporal communities across diverse datasets.
Findings
Effective detection of temporal communities in real-world datasets
The estrangement confinement method improves community stability over time
Applicable to synthetic and real-world evolving networks
Abstract
Temporal communities result from a consistent partitioning of nodes across multiple snapshots of an evolving complex network that can help uncover how dense clusters in a network emerge, combine, split and decay with time. Current methods for finding communities in a single snapshot are not straightforwardly generalizable to finding temporal communities since the quality functions used for finding static communities have highly degenerate landscapes, and the eventual partition chosen among the many partitions of similar quality is highly sensitive to small changes in the network. To reliably detect temporal communities we need not only to find a good community partition in a given snapshot but also ensure that it bears some similarity to the partition(s) found in immediately preceding snapshots. We present a new measure of partition distance called "estrangement" motivated by the…
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.
