def METHOD_NAME(graph, nodes, max_depth):
    """Implement of random walk.
    This function get random walks path for given nodes and depth.
    Args:
        nodes: Walk starting from nodes
        max_depth: Max walking depth
    Return:
        A list of walks.
    """
    walk_paths = []
    # init
    for node in nodes:
        walk_paths.append([node])
    cur_walk_ids = np.arange(0, len(nodes))
    cur_nodes = np.array(nodes)
    for l in range(max_depth - 1):
        # select the walks not end
        cur_succs = graph.successor(cur_nodes)
        mask = [len(succ) > 0 for succ in cur_succs]
        if np.any(mask):
            cur_walk_ids = cur_walk_ids[mask]
            cur_nodes = cur_nodes[mask]
            cur_succs = cur_succs[mask]
        else:
            # stop when all nodes have no successor
            break
        outdegree = [len(cur_succ) for cur_succ in cur_succs]
        sample_index = np.floor(
            np.random.rand(cur_succs.shape[0]) * outdegree).astype("int64")
        nxt_cur_nodes = []
        for s, ind, walk_id in zip(cur_succs, sample_index, cur_walk_ids):
            walk_paths[walk_id].append(s[ind])
            nxt_cur_nodes.append(s[ind])
        cur_nodes = np.array(nxt_cur_nodes)
    return walk_paths