, r w is then ∏ w i=1 r i (t) under a given t. The value of t is chosen when the probability is maximized: In a simple random walk, it is assumed that all nodes in the matrix M are equi-probable before the walk.
we use the topic preference vector as a prior on M. Let Diag(r) denote a diagonal matrix whose eigenvalue is vector r. Then m becomes: Diversity We would also like our output to be diverse without redundant information.