Note on Computing Ratings from Eigenvectors

Details Note on Computing Ratings from Eigenvectors Note on Computing Ratings from Eigenvectors

2010-05-05

arxiv.org/abs/1005.0762v1

Mathematics

Numerical Analysis

10 pages. Dedicated to Gene Golub 1932-2007.

Scientific paper

We consider the problem of computing ratings using the results of games played between a set of n players, and show how this problem can be reduced to computing the positive eigenvectors corresponding to the dominant eigenvalues of certain n by n matrices. There is a close connection with the stationary probability distributions of certain Markov chains. In practice, if n is large, then the matrices involved will be sparse, and the power method may be used to solve the eigenvalue problems efficiently. We give an algorithm based on the power method, and also derive the same algorithm by an independent method.

Affiliated with

Also associated with

No associations

Rating

Note on Computing Ratings from Eigenvectors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Note on Computing Ratings from Eigenvectors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note on Computing Ratings from Eigenvectors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437192