In this module we provide different methods for generating random walks given a graph. The algorithms in mOWL are a variation from the original ones. Graphs obtained from ontologies always have labeled edges, therefore the edge labels are included in the random walks.
Important
Random walks with size n will include n nodes with its edges (except in the last node). Therefore a random walk with size n will be at most 2n − 1 long.
mowl.walking