A Survey on PageRank Computing

DOI10.1080/15427951.2005.10129098zbMath1100.68504OpenAlexW2125493559MaRDI QIDQ5700148

Pavel Berkhin

Publication date: 27 October 2005

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2005.10129098

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (52)

Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph ⋮ The mathematics of non-linear metrics for nested networks ⋮ A new betweenness centrality measure based on an algorithm for ranking the nodes of a network ⋮ Ranking in evolving complex networks ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ A new shifting grid clustering algorithm ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ Random walks on binary strings applied to the somatic hypermutation of B-cells ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ Iterated endorsement deduction and ranking ⋮ An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ Random walks and diffusion on networks ⋮ Detection of key figures in social networks by combining harmonic modularity with community structure-regulated network embedding ⋮ Network Capacity Bound for Personalized PageRank in Multimodal Networks ⋮ A parallel pagerank algorithm for undirected graph ⋮ Black hole metric: overcoming the PageRank normalization problem ⋮ A scaling analysis of a cat and mouse Markov chain ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Axiomatic characterization of PageRank ⋮ Probabilistic Relation between In-Degree and PageRank ⋮ Modelling the navigation potential of a web page ⋮ PageRank optimization by edge selection ⋮ Quantifying the multi-scale performance of network inference algorithms ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ The extrapolation-accelerated multilevel aggregation method in PageRank computation ⋮ Several relaxed iteration methods for computing PageRank ⋮ A two-step matrix splitting iteration for computing PageRank ⋮ Fast distributed PageRank computation ⋮ New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks ⋮ Influence network in the Chinese stock market ⋮ Ranking nodes in general networks: a Markov multi-chain approach ⋮ On adaptively accelerated Arnoldi method for computing PageRank ⋮ The power method and beyond ⋮ An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector ⋮ The jump start power method: a new approach for computing the ergodic projector of a finite Markov chain ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ A preconditioning approach to the pagerank computation problem ⋮ An Arnoldi-extrapolation algorithm for computing pagerank ⋮ On computing PageRank via lumping the Google matrix ⋮ Distribution of PageRank Mass Among Principle Components of the Web ⋮ PageRank Beyond the Web ⋮ Review of statistical network analysis: models, algorithms, and software ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ Multiplicative Approximations of Random Walk Transition Probabilities ⋮ A Power–Arnoldi algorithm for computing PageRank ⋮ Multiscale Matrix Sampling and Sublinear-Time PageRank Computation ⋮ Monitoring Changes in RCA Models ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ Scalable Algorithms for Multiple Network Alignment ⋮ The coupled iteration algorithms for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems

This page was built for publication: A Survey on PageRank Computing