Starting from the dti network, first we applied a logarithmic transformation (\(\log {(x+1)}\) ) to make the weights more homogeneous.
Then, we performed a biased random walk [1]} to direct each edge from the node with lower strength to the node with higher strength. The probability \(P_{ji}\)  to go from node \(i\)  to node \(j\) , can be computed as
\(P_{ji} = \frac{w_{ji}}{ \sum _h {w_{ih}} }\) 
