On PageRank versatility for multiplex networks: properties and some useful bounds

DOI10.1002/MMA.6274MaRDI QIDQ5135583zbMATH OpenOpenAlexFDO

Authors Francisco Pedroche, Regino Criado, E. Garcia, Miguel Romance, Julio Flores

Publication date 23 November 2020

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

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

zbMATH Keywords

centrality measuresLaplacian matricesmultiplex networksPageRankversatility

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sharp estimates for the personalized multiplex PageRank
• On the spectrum of two-layer approach and multiplex PageRank
• A biplex approach to PageRank centrality: From classic to multiplex networks
• An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept
• Parametric controllability of the personalized PageRank: Classic model vs biplex approach

Cited in

(7)

• Sharp estimates for the personalized multiplex PageRank
• Spectral rank monotonicity on undirected networks
• An algorithm for ranking the nodes of multiplex networks with data based on the PageRank concept
• A biplex approach to PageRank centrality: From classic to multiplex networks
• Network Capacity Bound for Personalized PageRank in Multimodal Networks
• A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
• On the spectrum of two-layer approach and multiplex PageRank

This page was built for publication: On PageRank versatility for multiplex networks: properties and some useful bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5135583)