Community cores in evolving networks

ABSTRACT

Community structure is a key property of complex networks. Many algorithms have been proposed to automatically detect communities in static networks but few studies have considered the detection and tracking of communities in an evolving network. Tracking the evolution of a given community over time requires a clustering algorithm that produces stable clusters. However, most community detection algorithms are very unstable and therefore unusable for evolving networks. In this paper, we apply the methodology proposed in [seifi2012] to detect what we call community cores in evolving networks. We show that cores are much more stable than "classical" communities and that we can overcome the disadvantages of the stabilized methods.

References

1. T. Aynaud and J. Guillaume. Static community detection algorithms for evolving networks. In Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium on, pages 513--519. IEEE, 2010.
2. V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in largenetworks.Journal of Statistical Mechanics: Theory and Experiment, 2008:P10008, 2008.
3. D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. InProceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 554--560. ACM, 2006.
4. L. Costa, O. Oliveira Jr, G. Travieso, F. Rodrigues, P. Boas, L. Antiqueira, M. Viana, and L. Da Rocha. Analyzing and modeling real-world phenomena with complex networks: A survey of applications.Arxiv preprint arXiv:0711.3199, 2007.
5. S. Fortunato and M. Barthelemy. Resolution limit in community detection.Proceedings of the National Academy of Sciences, 104(1):36, 2007.
6. M. Giatsoglou and A. Vakali. Capturing social data evolution via graph clustering.IEEE Internet Computing, 99(PrePrints), 2012.
7. M. Girvan and M. Newman. Community structure in social and biological networks.Proceedings of the National Academy of Sciences, 99(12):7821, 2002.
8. R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, and A. Arenas. Self-similar community structure in a network of human interactions.Physical Review E, 68(6):065103, 2003.
9. J. Hopcroft, O. Khan, B. Kulis, and B. Selman. Tracking evolving communities in large linked networks.Proceedings of the national academy of sciences of the United States of America, 101(Suppl 1):5249, 2004.
10. A. Lancichinetti. Community detection algorithms: a comparative analysis.Physical Review E, 80(5):056117, 2009.
11. Y. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. Tseng. Analyzing communities and their evolutions in dynamic social networks.ACM Transactions on Knowledge Discovery from Data (TKDD), 3(2):8, 2009.
12. M. Newman. Finding community structure in networks using the eigenvectors of matrices.Physical Review E, 74(3):036104, 2006.
13. J. Pansiot, P. Merindol, B. Donnet, and O. Bonaventure. Extracting intra-domain topology from mrinfo probing. In Passive and Active Measurement, pages 81--90. Springer, 2010.
14. M. Seifi, S. Iskrov, J.-B. Rouquier, I. Junier, and J.-L. Guillaume. Stable community cores in complex networks. InStudies in Computational Intelligence. Springer, 2012.
15. M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult. Monic: modeling and monitoring cluster transitions. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 706--711. ACM, 2006.

Index Terms

• Information systems

  • Information systems applications