Re: One question about Authority/Hub computation

By  "different", I assume you referring to them having different results during  intermediate iterations, right?
We are not really interested in a1 and h1--but rather in a* and h*. Both reach the same fix point. [I suspect the rate of convergence for the first method is going to be faster--for the same reason asynchronous iterations on pagerank make it converge faster.]

rao

On Sun, Dec 14, 2008 at 5:05 PM, Jianhui Chen <Jianhui.Chen@asu.edu> wrote:

Hello, Dear Dr. Rao,

I have a question about the computation of Authority / Hub score as below:
-----------------------------------------------
If a0 and h0 are pre-given, let A be the adjacent matrix, we can
compute a1 and h1 via
following two approaches theoretically

1. a1 = A' * h0, h1 = A * a1
2. a1 = (A' * A) * a0, h1 = (A * A') * h0.

However, in generally, the two approaches would generate different result.

Could you please help to advice which one we should take for the computation?

Sorry for disturbing you during the weekend. Many thanks.

Jianhui