where \(w_{ni}\)  is the strength of the connection between two vertices \(V_n\)  and \(V_i, E(V_i)\) , and \(d\)  is the damping factor commonly set to \(0.85\)  [1]}, [2]}. \(TR(V_n)\)  reports the importance score assigned to a term. The algorithm initially initializes each term with score of 1. The rank update continues iterating until convergence. The convergence usually ends after \(20-30\)  iterations. The terms are then sorted based on ranking score. Finally, a list of terms with top-N ranked scores are extracted.
