A Reordering for the PageRank Problem

From MaRDI portal
Publication:5470406

DOI10.1137/040607551zbMath1103.65048OpenAlexW2048509145WikidataQ55970526 ScholiaQ55970526MaRDI QIDQ5470406

Amy N. Langville, Carl D. jun. Meyer

Publication date: 30 May 2006

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: http://www.lib.ncsu.edu/resolver/1840.4/447




Related Items

On the convergence of the minimally irreducible Markov chain method with applications to PageRankOff-diagonal low-rank preconditioner for difficult PageRank problemsA relaxed two-step splitting iteration method for computing PageRankAn adaptive reordered method for computing PageRankAccelerating the Arnoldi method via Chebyshev polynomials for computing PageRankMulti-linear pseudo-PageRank for hypergraph partitioningA variant of the Power-Arnoldi algorithm for computing PageRankAlgorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniquesConvergence of multi-level iterative aggregation-disaggregation methodsThe extrapolation-accelerated multilevel aggregation method in PageRank computationA two-step matrix splitting iteration for computing PageRankAn efficient elimination strategy for solving PageRank problemsPhysiology and pathology of iterative aggregation–disaggregation methodsNetwork structure exploration via Bayesian nonparametric modelsOn adaptively accelerated Arnoldi method for computing PageRankPageRank computation with MAAOR and lumping methodsAn Arnoldi-extrapolation algorithm for computing pagerankPageRank for networks, graphs, and Markov chainsOn the multi-splitting iteration method for computing PageRankOn computing PageRank via lumping the Google matrixThe Effect of New Links on Google PagerankA Hessenberg-type algorithm for computing PageRank problems