My research is mainly focused on Drug Target Prediction and Drug to Target to Adverse events prediction. I use Random walk on different heterogeneous networks for this. There are several papers which came up like .

1) Kohler 2008 (Walking the Interactome for Prioritization of Candidate Disease Genes)

2) The power of protein interaction networks for associating genes with diseases

3) Chen Etal ( Drug Target Prediction with Random walk with restart)

4) Genome-wide inferring gene–phenotype relationship by walking on the heterogeneous network

Here i will post some codes in R on how to perform a Normal Random walk on a small network using two method one proposed by Kohler (2008) and another proposed by Vanunu (2010).

1) Kohler 2008 (Walking the Interactome for Prioritization of Candidate Disease Genes)

2) The power of protein interaction networks for associating genes with diseases

3) Chen Etal ( Drug Target Prediction with Random walk with restart)

4) Genome-wide inferring gene–phenotype relationship by walking on the heterogeneous network

Here i will post some codes in R on how to perform a Normal Random walk on a small network using two method one proposed by Kohler (2008) and another proposed by Vanunu (2010).

The method iteratively simulates random transitions of a walker from a node to a randomly selected neighbour node and at any time step the walk can be restarted depending on a predefined probability. Random walk with restarts is slightly different than PageRank with priors in the way that it normalizes the link weights. The convergence is decided when a probability difference is less than 10e-10 between two consecutive time steps which is calculated by L1 / Frobenius norm. The loop breaks when the difference is less than value. The function assumes two types of method based

1 Kohler -> which is just a simple random walk

2 Vanunu - > Which is a modification of random walk with restarts such that the link weight is normalized not only by number of outgoing edges but also by number of incoming edges. They mentioned

*"**We chose to normalize the weight of an edge by the degrees of its end-points, since the latter relate to the probability of observing an edge between the same end-points in a random network with the same node degrees".*There are no such parameters applied here and also similarity matrices . This is the heart of the code of Random walk and one can modify on top of this as much as they can.

Hope this code makes life simple for some people when they try to understand it :)