We generalize random walks on graphs to random walks on simplicial complexes, also called hypergraphs, using some notions of topological algebra. The transition matrix of this RW is related to the higher order Laplacian which is the generalization of graph Laplacian. We also analyze the limit behavior of this RW when the number of points in the simplicial complex tends to infinity.