Fast Approximate CoSimRanks via Random Projections

Renchi Yang, Xiaokui Xiao

Given a graph $G$ with $n$ nodes and two nodes $u,v\in G$, the {\em CoSimRank} value $s(u,v)$ quantifies the similarity between $u$ and $v$ based on graph topology. Compared to Sim…