Matrix roots and embedding conditions for three-state discrete-time Markov chains with complex eigenvalues (Q2674040)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Matrix roots and embedding conditions for three-state discrete-time Markov chains with complex eigenvalues
scientific article

    Statements

    Matrix roots and embedding conditions for three-state discrete-time Markov chains with complex eigenvalues (English)
    0 references
    0 references
    22 September 2022
    0 references
    Let \(P\) be the transition matrix for a finite state discrete-time Markov chain. Then \(P\) is also called a \textit{stochastic matrix}; \(P\) has nonnegative entries and all row sums equal to \(1\). \(P\) is said to have a \textit{stochastic root} \(A\) if \(A\) is a stochastic matrix and there exists an integer \(m \geq 2\) such that \(P = A^m\). Necessary and sufficient conditions for stochastic roots have been established for Markov chains with 2 states, and with 3 states if all eigenvalues are real. In this work, the latter case is settled by considering the case when two of the eigenvalues are complex conjugates (recall that the largest eigenvalue is always \(1\)).
    0 references
    0 references
    Markov chain
    0 references
    embedding problem
    0 references
    matrix root
    0 references
    stochastic root
    0 references
    complex eigenvalues
    0 references

    Identifiers