Online detection of temporal communities in evolving networks by estrangement confinement
arXiv:1203.5126 · doi:10.1038/srep00794
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 inertia of inter-node relationships which, when incorporated into the measurement of partition quality, facilitates the detection of meaningful temporal communities. Specifically, we propose the estrangement confinement method, which postulates that neighboring nodes in a community prefer to continue to share community affiliation as the network evolves. Constraining estrangement enables us to find meaningful temporal communities at various degrees of temporal smoothness in diverse real-world datasets. Specifically, we study the evolution of voting behavior of senators in the United States Congress, the evolution of proximity in human mobility datasets, and the detection of evolving communities in synthetic networks that are otherwise hard to find. Estrangement confinement thus provides a principled approach to uncovering temporal communities in evolving networks.
References in corpus (9)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Community detection in graphs
- Near linear time algorithm to detect community structures in large-scale networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Quantifying social group evolution
- The performance of modularity maximization in practical contexts
- Detecting network communities by propagating labels under constraints
- Robustness of community structure in networks
Cited by in corpus (9)
- Community Discovery in Dynamic Networks: a Survey
- On community structure in complex networks: challenges and opportunities
- Importance of individual events in temporal networks
- Community detection in directed acyclic graphs
- Detecting Community Structure in Dynamic Social Networks Using the Concept of Leadership
- Using link and content over time for embedding generation in Dynamic Attributed Networks
- Temporal stability of network partitions
- Sequential Changepoint Approach for Online Community Detection
- Community Evolution