The basic assumption in DivRank is that the transition probability from a node to other is reinforced by the number of previous visits to the target node (Mei et al., 2010).
let's assume p T (u, v) is the transition probability from any node u to node v at time T .