The Effect of New Links on Google Pagerank
From MaRDI portal
Publication:5478910
DOI10.1080/15326340600649052zbMath1094.68005OpenAlexW2117925456MaRDI QIDQ5478910
Nelly Litvak, Konstantin E. Avrachenkov
Publication date: 13 July 2006
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00070742/file/RR-5256.pdf
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
Faster geometric algorithms via dynamic determinant computation ⋮ Reputation games for undirected graphs ⋮ Improving the Betweenness Centrality of a Node by Adding Links ⋮ Local weak convergence for PageRank ⋮ On the approximability of the link building problem ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Axiomatic characterization of PageRank ⋮ The Computational Complexity of Link Building ⋮ Hardness of bounding influence via graph modification ⋮ Optimizing node discovery on networks: problem definitions, fast algorithms, and observations ⋮ Perron vector optimization applied to search engines ⋮ PageRank optimization by edge selection ⋮ Maximizing PageRank via outlinks ⋮ Hitting times in Markov chains with restart and their application to network centrality ⋮ Ranking nodes in general networks: a Markov multi-chain approach ⋮ Mean field analysis of personalized PageRank with implications for local graph clustering ⋮ A combined approach for evaluating papers, authors and scientific journals ⋮ Distribution of PageRank Mass Among Principle Components of the Web ⋮ Determining Factors Behind the PageRank Log-Log Plot ⋮ On the maximum betweenness improvement problem ⋮ Axioms for Centrality ⋮ The Buck-Passing Game
Cites Work
