Deeper Inside PageRank
From MaRDI portal
Publication:4672754
DOI10.1080/15427951.2004.10129091zbMath1098.68010OpenAlexW2014478203MaRDI QIDQ4672754
Amy N. Langville, Carl D. jun. Meyer
Publication date: 3 May 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2004.10129091
Related Items
Networks beyond pairwise interactions: structure and dynamics, On the convergence of the minimally irreducible Markov chain method with applications to PageRank, A new betweenness centrality measure based on an algorithm for ranking the nodes of a network, Secure fast evaluation of iterative methods: with an application to secure PageRank, Acceleration of the generalized FOM algorithm for computing PageRank, A continuum limit for the PageRank algorithm, A note on the pagerank algorithm, The PageRank vector of a scale-free web network growing by preferential attachment, An Arnoldi-type algorithm for computing Page Rank, Conditioning of the entries in the stationary vector of a Google-type matrix, A new extrapolation method for PageRank computations, The eigenvalue problem of a specially updated matrix, An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank, Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors, On the approximability of the link building problem, Convergence of the Nelder-Mead method, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, Fast computation of stationary joint probability distribution of sparse Markov chains, The Kemeny constant for finite homogeneous ergodic Markov chains, Discrete-time quantum walk algorithm for ranking nodes on a network, Random walks and diffusion on networks, An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank, Ranking nodes in directed networks via continuous-time quantum walks, Preface: stochastic resetting—theory and applications, Black hole metric: overcoming the PageRank normalization problem, A variant of the Power-Arnoldi algorithm for computing PageRank, Axiomatic characterization of PageRank, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Userrank for item-based collaborative filtering recommendation, Prediction of effective elastic moduli of rocks using graph neural networks, Comparison of three Web search algorithms, The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis, A Brauer's theorem and related results, On new PageRank computation methods using quantum computing, Probabilistic Relation between In-Degree and PageRank, Representing and Quantifying Rank - Change for the Web Graph, Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks, Practical acceleration for computing the HITS expertrank vectors, An efficient PageRank approach for urban traffic optimization, Justifying the small-world phenomenon via random recursive trees, Non-backtracking PageRank: from the classic model to Hashimoto matrices, High-order degree and combined degree in complex networks, Identifying systemically important financial institutions: a network approach, An adaptive Power-GArnoldi algorithm for computing PageRank, Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem, 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, Parallel multisplitting iteration methods based on M-splitting for the PageRank problem, Maximizing PageRank via outlinks, Algebraic connectivity may explain the evolution of gene regulatory networks, New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks, EXPLORING AND UNDERSTANDING CITATION-BASED SCIENTIFIC METRICS, Potential induced random teleportation on finite graphs, Hitting times in Markov chains with restart and their application to network centrality, Perturbed Markov chains with damping component, Ranking nodes in general networks: a Markov multi-chain approach, Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations, On adaptively accelerated Arnoldi method for computing PageRank, Eigenvalues of rank-one updated matrices with some applications, An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector, Random Walks on Dense Graphs and Graphons, Mean field analysis of personalized PageRank with implications for local graph clustering, On the eigenvalues of a specially updated complex matrix, The general inner-outer iteration method based on regular splittings for the PageRank problem, Choose the damping, choose the ranking?, Necessary and sufficient local convergence condition of one class of iterative aggregation–disaggregation methods, On the eigenvalues of specially low-rank perturbed matrices, Applications of Page Ranking in P Systems, Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph, Google pageranking problem: The model and the analysis, An Arnoldi-extrapolation algorithm for computing pagerank, Structured Eigenvalue Problems, On the spectrum of two-layer approach and multiplex PageRank, Flexible and deflated variants of the block shifted GMRES method, A note on the two-step matrix splitting iteration for computing PageRank, On the multi-splitting iteration method for computing PageRank, Coevolutionary systems and PageRank, On computing PageRank via lumping the Google matrix, Distribution of PageRank Mass Among Principle Components of the Web, Determining Factors Behind the PageRank Log-Log Plot, PageRank Beyond the Web, The mathematics of internet search engines, A multi-power and multi-splitting inner-outer iteration for PageRank computation, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, Multiplicative Approximations of Random Walk Transition Probabilities, A Dynamic Algorithm for Network Propagation, A Power–Arnoldi algorithm for computing PageRank, The Effect of New Links on Google Pagerank, Web Markov skeleton processes and their applications, Non-backtracking PageRank, LiveRank: How to Refresh Old Datasets, Competitive economy as a ranking device over networks, Google PageRank as mean playing time for pinball on the reverse web, Indirect influences in international trade, The coupled iteration algorithms for computing PageRank, A Hessenberg-type algorithm for computing PageRank problems
