We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one from revealed subset of entries. bound asymptotic convergence rate by variational characterization eigenvalues reversible consensus problem. This leads to polynomial upper on terms number nodes as well largest degree graph