Порівняння методів

	Багатошарове виявлення спільнот	Виявлення спільнот
Галузь	Мережевий аналіз	Мережевий аналіз
Родина	Machine learning	Process / pipeline
Рік появи	2010–2014	2002–2019 (algorithm family)
Автор методу	Mucha, P. J. et al.; Kivela, M. et al.	Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008)
Тип	Community detection algorithm for multilayer networks	Graph-partitioning / clustering algorithm family
Основоположне джерело	Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014). Multilayer networks. Journal of Complex Networks, 2(3), 203–271.	Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008.
Інші назви	multilayer clustering, multiplex community detection, cross-layer community detection, MCD	graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden)
Пов'язані	5	5
Підсумок	Multilayer community detection identifies groups of nodes that are densely connected across multiple types of relationships simultaneously. By coupling layers of a network — such as friendship, advice, and collaboration ties — it finds communities that are coherent not just within one relation type but across all of them, revealing structure that single-layer analysis would miss.	Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network?