3 ms·
> My high credibility makes someone else have bad credibility, which changes the rankings again. How many iterations do we run before we consider the results st
by lesuorac 3y ago
> My high credibility makes someone else have bad credibility, which changes the rankings again. How many iterations do we run before we consider the results stable?
Tangential to your point but this is actually a solved problem and you only have to run once. You might even recognize the solution [1] [2].
[1]: https://en.wikipedia.org/wiki/PageRank https://en.wikipedia.org/wiki/PageRank
[2]: https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors
- jvanderbot 3y agoMore generally factor graph optimization / msg passing, if you don't need the constraint that it must be an eigenvector/eigenvalue operation. The number of iterations is bounded by graph width but is locally constant, if memory serves.
- deleted 3y ago[deleted]
- JCharante 3y agoWhy only once? When we did pagerank in class we chose a precision factor and then iterated pagerank until the delta values for the matrices were less than the precision factor