I will discuss random walks on simplicial complexes, Cheeger inequalities, and mixing times. The talk will summarize the results of two papers that explore how random walks on walks graphs extend to simplicial complexes. I will also discus two papers that study higher order Laplacians and expander properties. Two possible applications in machine learning will be discussed: spectral clustering and label (edge) propogation. joint work with John Steenbergen