發信人: sarach (sarach), 信區: DataMining
標  題: 請問PageRank的收斂性是怎么證明的呀？
發信站: 南京大學小百合站 (Thu Sep 26 15:11:10 2002), 站內信件

在Lawrence Page的那篇PageRank的論文上的一段：
Let A be a square matrix with the rows and column correspondeing
to web pages. Let A(u,v)=1/N(u) if there is an
edge from u to v and A(u,v)=0 if not. If we treat R as a vector over web pages,
then we have R=cAR. So R is an eigenvector of A with eigenvalue c.
In fact, we want the dominant eigenvector of A. It may be computed
by repeatedly applying A to any nondegenerate start vector.

但是并沒有給出向量R的收斂性的證明，
哪位大蝦能幫忙證一下呀? 謝謝！

--
※ 來源:．南京大學小百合站 bbs.nju.edu.cn．[FROM: 202.38.243.91]