Abstract:
In Part 1 of this paper, we consider the web-pages ranking problem also known as the problem of finding the PageRank vector or Google problem. We discuss the connection of this problem with the ergodic theorem and describe different numerical methods to solve this problem together with their theoretical background, such as Markov Chain Monte Carlo and equilibrium in a macrosystem.
Key words:
Markov chain, ergodic theorem, multinomial distribution, measure concentration, maximum likelihood estimate, Google problem, gradient descent, automatic differentiation, power law distribution.
Citation:
A. Gasnikov, E. Gasnikova, P. Dvurechensky, A. Mohammed, E. Chernousova, “About the power law of the PageRank vector distribution. Part 1. Numerical methods for finding the PageRank vector”, Sib. Zh. Vychisl. Mat., 20:4 (2017), 359–378; Num. Anal. Appl., 10:4 (2017), 299–312
This publication is cited in the following 6 articles:
Pavel Dvurechensky, Alexander Gasnikov, Alexander Tyurin, Vladimir Zholobov, Springer Proceedings in Mathematics & Statistics, 425, Foundations of Modern Statistics, 2023, 511
P. Dvurechensky, E. Gorbunov, A. Gasnikov, “An accelerated directional derivative method for smooth stochastic convex optimization”, Eur. J. Oper. Res., 290:2 (2021), 601–621
Mikhail Koshelev, “New lower bound on the modularity of Johnson graphs”, Moscow J. Comb. Number Th., 10:1 (2021), 77
Nikita Derevyanko, Mikhail Koshelev, Andrei Raigorodskii, Trends in Mathematics, 14, Extended Abstracts EuroComb 2021, 2021, 221
K. Kovalenko, “On the independence number and the chromatic number of generalized preferential attachment models”, Discret Appl. Math., 285 (2020), 301–306
A. Gasnikov, P. Dvurechensky, M. Zhukovskii, S. Kim, S. Plaunov, D. Smirnov, F. Noskov, “About the power law of the PageRank vector distribution. Part 2. Backley–Osthus model, power law verification for this model and setup of real search engines”, Num. Anal. Appl., 11:1 (2018), 16–32