Võrdle meetodeid

	Multilayer Network Analysis	Tsentraalsuse analüüs
Valdkond	Võrgustikuanalüüs	Võrgustikuanalüüs
Perekond	Process / pipeline	Process / pipeline
Tekkeaasta	2013–2014 (formal mathematical framework)	1979
Looja	Kivelä et al. (2014); De Domenico et al. (2013)	Linton C. Freeman
Tüüp	Graph-theoretic network model	Descriptive / exploratory network measure family
Algallikas	Kivelä, M. et al. (2014). Multilayer Networks. Journal of Complex Networks, 2(3), 203–271.	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.
Rööpnimetused	multiplex network analysis, multiplex networks, Çok Katmanlı Ağ Analizi (Multiplex Networks)	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality
Seotud	6	5
Kokkuvõte	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.	Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors.