Exponential of (Markov Chain) Transition matrix

NewStudent200
Messages
5
Reaction score
0
Hi,

I have a (markov chain) transition matrix X which I understand. In particular each row of this matrix sums to 1.

I have used this transition matrix to construct it's generator, Y. I.e. Y is the continuously compounded transition matrix,

X = exp(Y)
X*X = exp(2Y), etc

both X and Y are matrices.

I am told that the sums of Y must sum to 0, but I can not see why this should be the case. Is it obvious?

Many Thanks.
 
Physics news on Phys.org
Possible hint maybe? e^0=1
 
Thanks.

But I have trouble visualizing this for a matrix. Is there aproof somewhere, or a text that you can recommend which gives examples and talks about the applications of taking exponentials or logs of matrices?

Many thanks,
 
It is a http://en.wikipedia.org/wiki/Matrix_exponential" right ? If you write down the power series for it you will get a pattern.

<br /> X = I + Y + \frac{Y^2}{2!} + \ldots<br />
Now if you sum up the rows of X it is 1. On the right hand side you already get 1 from the identity matrix. So all contributions from the remaining terms must be zero right? So I will let you think if your condition is sufficient or necessary.
 
Last edited by a moderator:
Cool. Thanks a lot!

Thinking about matrices a little further. How does one raise a matrix to a decimal power. I know that in the case of an integer power:

X^n = S.M^n.S^-1

where S is the eigen vector matrix and M is the matrix with eigen values along the diagonal. Now if n is non integer, then does this still hold? Could we also do it via:

Y = X^n
ln(Y) = n.ln(X)
Y = exp(n.ln(X))?

much appreciated.
 
NewStudent200 said:
Cool. Thanks a lot!

Thinking about matrices a little further. How does one raise a matrix to a decimal power. I know that in the case of an integer power:

X^n = S.M^n.S^-1

where S is the eigen vector matrix and M is the matrix with eigen values along the diagonal. Now if n is non integer, then does this still hold? Could we also do it via:

Y = X^n
ln(Y) = n.ln(X)
Y = exp(n.ln(X))?

much appreciated.

yes, yes

also:
if X = S M S^{-1} then e^X = S e^M S^{-1}, \log(X) = S \log(M) S^{-1}, etc.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top