পদ্ধতির তুলনা করুন

	মাল্টিলেয়ার পেজর‍্যাঙ্ক	মাল্টিলেয়ার বিটুইননেস সেন্ট্রালিটি
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2015	2013–2014
প্রবর্তক	De Domenico, M.; Sole-Ribalta, A.; Arenas, A. et al.	De Domenico, M.; Kivelä, M.; Arenas, A. et al.
ধরন	Centrality measure (random-walk-based)	Centrality measure (multilayer extension)
মৌলিক উৎস	De Domenico, M., Sole-Ribalta, A., Omodei, E., Gomez, S., & Arenas, A. (2015). Ranking in interconnected multilayer networks reveals versatile nodes. Nature Communications, 6, 6868.	De Domenico, M., Solé-Ribalta, A., Cozzo, E., Kivelä, M., Moreno, Y., Porter, M. A., Gómez, S., & Arenas, A. (2013). Mathematical formulation of multilayer networks. Physical Review X, 3(4), 041022.
অপর নাম	multiplex PageRank, layer-coupled PageRank, multilayer random walk centrality, MuxRank	MBC, multilayer geodesic betweenness, tensorial betweenness centrality, interlayer betweenness centrality
সম্পর্কিত	5	5
সারসংক্ষেপ	Multilayer PageRank extends the classic PageRank random-walk centrality to networks that contain multiple interconnected layers — such as a social network where people are connected simultaneously via friendship, professional ties, and online platforms. By allowing a virtual walker to jump both within and across layers, the algorithm identifies nodes that are influential across the entire multilayer structure, not just within any single layer.	Multilayer betweenness centrality extends the classical betweenness measure to networks with multiple types of relationships — or layers — by computing how often a node lies on shortest paths that can traverse any layer or switch between layers. It identifies brokers and bridges whose influence spans distinct interaction domains simultaneously.