The Monte Carlo method has been successfully used for computing the extreme (largest and smallest in magnitude) eigenvalues of matrices. In this paper we study computing eigenvectors as well with the Monte Carlo approach. We propose and study a Monte Carlo method based on applying the ergodic theorem and compare the results with those produced by a Monte Carlo version of the power method. We also study the problem of computing more than one eigenpair combining our Monte Carlo method and deflation techniques.