On the spectrum of two-layer approach and multiplex PageRank

DOI10.1016/j.cam.2018.05.033zbMath1393.68023OpenAlexW2803237703WikidataQ129781848 ScholiaQ129781848MaRDI QIDQ724498

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

Publication date: 26 July 2018

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

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

zbMATH Keywords

multiplex networksPageRankcentrality measures

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51) Internet topics (68M11)

Cites Work

• Unnamed Item
• An Arnoldi-Inout algorithm for computing PageRank problems
• A new extrapolation method for PageRank computations
• A Perron-Frobenius theory for block matrices associated to a multiplex network
• A note on the two-step matrix splitting iteration for computing PageRank
• Traveling salesman problems with PageRank distance on complex networks reveal community structure
• Sharp estimates for the personalized multiplex PageRank
• New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
• An efficient elimination strategy for solving PageRank problems
• Using PageRank for non-personalized default rankings in dynamic markets
• On the localization of the personalized PageRank of complex networks
• PageRank Beyond the Web
• Multilinear PageRank
• A biplex approach to PageRank centrality: From classic to multiplex networks
• Deeper Inside PageRank

This page was built for publication: On the spectrum of two-layer approach and multiplex PageRank