The function performs a random Walk on a given graph.

1 |

`W` |
a numeric matrix representing the adjacency matrix of the graph |

`ind.positives` |
indices of the "core" positive examples of the graph. They represent the indices of W corresponding to the positive examples |

`tmax` |
maximum number of iterations (steps) (def: 1000) |

`eps` |
maximum allowed difference between the computed probabilities at the steady state (def. 1e-10) |

`norm` |
if TRUE (def) the adjacency matrix |

RW performs a random Walk on a given graph by performing 1 or more steps on the graph, depending on the value of the tmax parameter. It stops also if the difference of the norm of the probabilities between two consecutive steps is less than eps.

A list with three elements:

`p` |
numeric vector. Probability of each node at the steady state or after tmax iterations |

`ind.positives` |
indices of the "core" positive examples of the graph (it is equal to the same input parameter) |

`n.iter` |
number of performed steps/iterations |

L. Lovasz, Random Walks on Graphs: a Survey, Combinatorics, Paul Erdos is Eighty, vol. 2, pp. 146, 1993.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | ```
# Application of the random walk to the prediction of the DrugBank category Penicillins
# using the Tanimoto chemical structure similarity network
# between 1253 DrugBank drugs
library(bionetdata);
data(DD.chem.data);
data(DrugBank.Cat);
labels <- DrugBank.Cat[,"Penicillins"];
ind.pos <- which(labels==1);
# 2-step random walk
res <- RW(DD.chem.data, ind.pos, tmax = 2);
## Not run:
# 5 steps random walk
res <- RW(DD.chem.data, ind.pos, tmax = 5);
## End(Not run)
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.