  We prove optimal convergence rates for eigenvalues and eigenvectors of the
graph Laplacian on Poisson point clouds. Our results are valid down to the
critical percolation threshold, yielding error estimates for relatively sparse
graphs.
