recently, a lot of papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path $\mathbb{z}$. in the present talk, we develop a spectral analysis for lamplighter random walks on finite graphs. in the general case, we use the $c_2$-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. in the case the graph has a transitive isometry group $g$, we also describe the spectral analysis in terms of the representation theory of the wreath product $c_2\wr g$. we apply our theory to the lamplighter random walks on the complete graph and on the discrete circle. these examples were already studied by haggstrom and jonasson by probabilistic methods.