1. A linear mapping is not a "kind of equivalence" by any reasonable definition. For instance, the function that maps every vector to 0 is a linear mapping, and it has plenty of eigenvectors. (All with eigenvalue 0.)
2. The eigenvectors are not the rows of the diagonalized matrix. They are the rows (or columns, depending on just how you define things) of the matrix that does the coordinate transformation to diagonalize your matrix.
3. I think the paragraph beginning "For the common 3D isometric ..." is rather confused. I certainly am when reading it. Perhaps the problem is in my brain; what exactly do you mean? (Here's the nearest true thing I can think of to what that paragraph says: For many, but not all, linear transformations from a space to itself, there is an orthogonal coordinate system with respect to which the transformation's matrix is diagonal; then the eigenvectors are the axes of that coordinate system, and the eigenvalues are the amounts by which vectors along those axes get stretched.)
4. Tensors are just as linear as matrices. (You can do nonlinear things with a tensor, but then you can with a matrix too.)
5. The probabilities in a Markov chain's stationary state are not eigenvalues. (Well, I'm sure they're eigenvalues of something; any set of numbers can be made the eigenvalues of something; but they aren't, e.g., eigenvalues of the transition matrix.) What you may be thinking of is: a stationary state of a Markov chain is an eigenvector of the transition matrix, with eigenvalue 1; all eigenvalues have absolute value at most 1; if the Markov chain is ergodic (i.e., can get from any state to any other), then there is exactly one stationary state, exactly one eigenvector of eigenvalue 1, and all the other eigenvalues are strictly smaller. This is enough to guarantee convergence to the stationary state.
Also: If eigenvalues are as important in dealing with higher-order tensors as they are for the second-order case (i.e., matrices) then that's news to me. Tell me more?