Sketch-based community detection in evolving networks
Andre Beckus, George K. Atia

TL;DR
This paper introduces a sketch-based method for detecting and analyzing community evolution in large, dynamic networks, efficiently identifying key events like growth, merging, and splitting.
Contribution
It presents a novel sketch-based algorithm for real-time community detection in evolving networks, capable of handling large and imbalanced clusters efficiently.
Findings
Efficient detection of community events in large networks.
Improved handling of small clusters through balanced sketch construction.
Enhanced performance demonstrated on a new stochastic block model benchmark.
Abstract
We consider an approach for community detection in time-varying networks. At its core, this approach maintains a small sketch graph to capture the essential community structure found in each snapshot of the full network. We demonstrate how the sketch can be used to explicitly identify six key community events which typically occur during network evolution: growth, shrinkage, merging, splitting, birth and death. Based on these detection techniques, we formulate a community detection algorithm which can process a network concurrently exhibiting all processes. One advantage afforded by the sketch-based algorithm is the efficient handling of large networks. Whereas detecting events in the full graph may be computationally expensive, the small size of the sketch allows changes to be quickly assessed. A second advantage occurs in networks containing clusters of disproportionate size. 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.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Evolutionary Game Theory and Cooperation
