Lights Out is a single player game on graph G. The game starts with a coloring of the vertices of G with two colors, 0 and 1. At each step, one vertex is toggled which switches the color of that vertex and all of its neighbors. The game is won when all vertices have color 0. This game can be analyzed using linear algebra over a finite field, for example the number of solvable colorings of a graph is 2 to the rank of A + I, where A is the adjacency matrix of the graph, and I is the identity. We consider the stochastic process arising from toggling a sequence of random vertices. We demonstrate how the process can be viewed as a random walk on an associated state graph. We then find the eigenvalues of the state graph, and use them to bound the rate of convergence and hitting times. We also provide bounds on the average number of steps until this random process reaches the all 0 coloring that are asymptotically tight for many families of graphs.