Ergodic Control and Polyhedral Approaches to PageRank Optimization

DOI10.1109/TAC.2012.2226103zbMath1369.90142arXiv1011.2348OpenAlexW1819827759MaRDI QIDQ5353079

Stéphane Gaubert, Marianne Akian, Mustapha Bouhtou, Olivier Fercoq

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Internet topics (68M11)

Related Items (7)

The greedy strategy for optimizing the Perron eigenvalue ⋮ On the approximability of the link building problem ⋮ PageRank computation via a distributed randomized approach with lossy communication ⋮ Hardness of bounding influence via graph modification ⋮ Perron vector optimization applied to search engines ⋮ PageRank optimization by edge selection ⋮ Hitting times in Markov chains with restart and their application to network centrality

This page was built for publication: Ergodic Control and Polyhedral Approaches to PageRank Optimization