By Topic

Estimating the principal eigenvector of a stochastic matrix: Mirror Descent Algorithms via game approach with application to PageRank problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nazin, A. ; Lab. for Adaptive & Robust Control Syst., Inst. of Control Sci. RAS, Moscow, Russia

The problem of estimating the principal eigenvector related to the largest eigenvalue of a given (left) stochastic matrix A has many applications in ranking search results, multi-agent consensus, networked control and data mining. The well-known power method is a typical tool, but it modifies matrix and, therefore, the related solution. We propose and study both deterministic and randomized game algorithms based on Mirror Descent (MD) method which are intended for bounding the Euclidean norm residual ∥Ax-x∥2 on the standard simplex in ℝN. We prove the explicit uniform upper bounds of type O(√ln(N)/n) with arbitrary horizon n ≥ 1. They improve the similar earlier results with respect to n which have been proved for the squared norm residual, i.e. ∥Ax-x∥22. Numerical results for N = 100 illustrate the general decrease of the norm residual ∥Ax̂t-x̂t2 in time t and corroborate theoretical results.

Published in:

Decision and Control (CDC), 2010 49th IEEE Conference on

Date of Conference:

15-17 Dec. 2010