A Singular Perturbation Approach for Choosing the PageRank Damping Factor

DOI10.1080/15427951.2008.10129300zbMath1206.68349arXivmath/0612079OpenAlexW2032092435MaRDI QIDQ3078597

Nelly Litvak, Kim Pham, Konstantin E. Avrachenkov

Publication date: 28 February 2011

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

Full work available at URL: https://arxiv.org/abs/math/0612079

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items (13)

On the convergence of the minimally irreducible Markov chain method with applications to PageRank ⋮ Ranking in evolving complex networks ⋮ On perturbations of principal eigenvectors of substochastic matrices ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes ⋮ On some analytical properties of a general PageRank algorithm ⋮ 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 ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering ⋮ Choose the damping, choose the ranking? ⋮ Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph ⋮ Parallel computing for Markov chains with islands and ports ⋮ The Buck-Passing Game

This page was built for publication: A Singular Perturbation Approach for Choosing the PageRank Damping Factor