Sharp estimates for the personalized multiplex PageRank

DOI10.1016/j.cam.2017.02.013zbMath1380.68025OpenAlexW2591090975MaRDI QIDQ1676039

Regino Criado, Francisco Pedroche, Miguel Romance, Esther García

Publication date: 3 November 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/145403

zbMATH Keywords

multiplex networksPageRankcentrality measures

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Internet topics (68M11) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Mathematical modeling and computational methods ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ On the edges’ PageRank and line graphs ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ Parametric controllability of the personalized PageRank: Classic model vs biplex approach

Cites Work

• Unnamed Item
• Unnamed Item
• Random walk centrality in interconnected multilayer networks
• Complex networks: structure and dynamics
• On the localization of the personalized PageRank of complex networks
• Navigability of interconnected networks under random failures
• Eigenvector centrality of nodes in multiplex networks
• A biplex approach to PageRank centrality: From classic to multiplex networks