Skip to main content

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem.

  In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple.

I ask: Are there any sufficient conditions known when all (or at least all real) eigenvalues of such a matrix are simple?

Thank you very much.

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem.

  In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple.

I ask: Are there any sufficient conditions known when all (or at least all real) eigenvalues of such a matrix are simple?

Thank you very much.

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem. In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple.

Are there any sufficient conditions known when all (or at least all real) eigenvalues of such a matrix are simple?

Thank you very much.

Source Link

Sufficient conditions for all eigenvalues simple in stochastic matrix

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem.

In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple.

I ask: Are there any sufficient conditions known when all (or at least all real) eigenvalues of such a matrix are simple?

Thank you very much.