I understand that a Markov Chain is reducible if, given its transition matrix $P$, there exists $n$ such that every element of $P^n$ is greater than 0.
However, I am wondering that if there is an fast and practical way to detect a Markov chain is regular numerically.
Thanks.