full rank by inspection

Question

I have an $n\times n$ matrix where each row is a probability vector. In the $2\times 2$ case, the matrix has full rank so long as the two rows differ. I wonder whether for $n \geq 3$ there is still any way to determine whether the matrix has full rank by "comparing rows" without calculating the eigenvalues or determinants.