Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
From MaRDI portal
Publication:6664835
DOI10.1016/j.cam.2024.116332MaRDI QIDQ6664835
Guo-Liang Han, Jian-Jun Wang, Zhao-Li Shen, Chun Wen, Bruno Carpentieri, Yutong Liu
Publication date: 16 January 2025
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Arnoldi-Inout algorithm for computing PageRank problems
- A new extrapolation method for PageRank computations
- A two-step matrix splitting iteration for computing PageRank
- On the spectrum of two-layer approach and multiplex PageRank
- A note on the two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- FOM accelerated by an extrapolation method for solving PageRank problems
- On computing PageRank via lumping the Google matrix
- Adaptive methods for the computation of PageRank
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- A GMRES-power algorithm for computing PageRank problems
- An efficient elimination strategy for solving PageRank problems
- Extrapolation methods for PageRank computations
- The general inner-outer iteration method based on regular splittings for the PageRank problem
- A variant of the Power-Arnoldi algorithm for computing PageRank
- A general multi-splitting iteration method for computing PageRank
- Comparison of Krylov subspace methods on the PageRank problem
- PageRank Beyond the Web
- The university of Florida sparse matrix collection
- Random Alpha PageRank
- An Inner-Outer Iteration for Computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- A General Setting for the Parametric Google Matrix
- A biplex approach to PageRank centrality: From classic to multiplex networks
- The uniqueness of multilinear PageRank vectors
- On adaptively accelerated Arnoldi method for computing PageRank
- Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
- A Reordering for the PageRank Problem
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- Updating Markov Chains with an Eye on Google's PageRank
This page was built for publication: Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
