विधियों की तुलना करें

	सामुदायिक पहचान	बहुस्तरीय नेटवर्क विश्लेषण
क्षेत्र	नेटवर्क विश्लेषण	नेटवर्क विश्लेषण
परिवार	Process / pipeline	Process / pipeline
उद्भव वर्ष	2002–2019 (algorithm family)	2013–2014 (formal mathematical framework)
प्रवर्तक	Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008)	Kivelä et al. (2014); De Domenico et al. (2013)
प्रकार	Graph-partitioning / clustering algorithm family	Graph-theoretic network model
मौलिक स्रोत	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.	Kivelä, M. et al. (2014). Multilayer Networks. Journal of Complex Networks, 2(3), 203–271.
उपनाम	graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden)	multiplex network analysis, multiplex networks, Çok Katmanlı Ağ Analizi (Multiplex Networks)
संबंधित	5	6
सारांश	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?	Multilayer network analysis is a graph-theoretic framework, formalised by Kivelä et al. (2014) and De Domenico et al. (2013), that represents the same set of nodes simultaneously across multiple relationship layers. Where a single-layer network collapses all relationships into one graph, the multilayer model preserves the distinct relational context of each layer — social platform, biological interaction type, or infrastructure tier — while also modelling how layers couple with each other through interlayer edges.