В докладе рассматриваются алгоритмы k-clique percolation, Керниган-Лин, Гирвана-Ньюмена, распространения меток. Вводится понятие модулярности сетевого сообщества.
Докладчик: Станислав Воробьев
Материалы:
- Communities in Networks (Mason A. Porter, Jukka-Pekka Onnela, and Peter J. Mucha). Notices of AMS, Vol 56, N9. http://people.maths.ox.ac.uk/porterm/papers/comnotices.pdf
- Near linear time algorithm to detect community structures in large-scale networks (Usha Nandini Raghavan, R´eka Albert and Soundar Kumara). http://arxiv.org/abs/0709.2938v1
- Finding community structure in very large networks (Aaron Clauset, M. E. J. Newman and Cristopher Moore). http://arXiv.org/abs/cond-mat/0408187v2
- Fast unfolding of communities in large networks (Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne Lefebvre). http://arXiv.org/abs/0803.0476v2
- Community structure in social and biological networks (Michelle Girvan and M. E. J. Newman). http://www.santafe.edu/media/workingpapers/01-12-077.pdf
- Finding community structure in networks using the eigenvectors of matrices (M. E. J. Newman). http://arxiv.org/abs/physics/0605087v3
- Modularity and community structure in networks (M. E. J. Newman). http://www.pnas.org/content/103/23/8577.abstract