Sequential detection of temporal communities by estrangement confinement
Authors:
Open Access
- 9 November 2012
- journal article
- research article
- Published by Springer Nature in Scientific Reports
- Vol. 2 (1) , 794
Abstract
Temporal communities are the result of a consistent partitioning of nodes across multiple snapshots of an evolving network, and they provide insights into how dense clusters in a network emerge, combine, split and decay over time. To reliably detect temporal communities we need to not only find a good community partition in a given snapshot but also ensure that it bears some similarity to the partition(s) found in the previous snapshot(s), a particularly difficult task given the extreme sensitivity of community structure yielded by current methods to changes in the network structure. Here, motivated by the inertia of inter-node relationships, we present a new measure of partition distance called estrangement, and show that constraining estrangement enables one to find meaningful temporal communities at various degrees of temporal smoothness in diverse real-world datasets. Estrangement confinement thus provides a principled approach to uncovering temporal communities in evolving networks.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Community detection in graphsPhysics Reports, 2010
- Mapping Change in Large NetworksPLOS ONE, 2010
- Detecting network communities by propagating labels under constraintsPhysical Review E, 2009
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Near linear time algorithm to detect community structures in large-scale networksPhysical Review E, 2007
- Quantifying social group evolutionNature, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences of the United States of America, 2006
- Social inertia in collaboration networksPhysical Review E, 2006
- Reality mining: sensing complex social systemsPersonal and Ubiquitous Computing, 2005
- Analysis of weighted networksPhysical Review E, 2004