By Topic

A randomized algorithm for finding eigenvector of stochastic matrix 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
$33 $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

2 Author(s)

The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent consensus, networked control and data mining. The well known power method is a typical tool for its solution. However randomized methods could be competitors vs standard ones; they require much less calculations for one iteration and are well tailored for distributed computations. We propose a new randomized algorithm and provide an explicit upper bound for its rate of convergence O(radicInN/n) where N is the dimension and n is the number of iterations. The bound looks promising because radicInN is not large even for very high dimensions. The algorithm is based on the mirror-descent method for convex stochastic optimization.

Published in:

2009 IEEE Control Applications, (CCA) & Intelligent Control, (ISIC)

Date of Conference:

8-10 July 2009