Transforms that Preserve The Dominant Eigenvector?

  • Thread starter Thread starter csguy
  • Start date Start date
  • Tags Tags
    Eigenvector
csguy
Messages
2
Reaction score
0
Hi,

I'm working with stochastic matrices (square matrices where each entry is a probability of moving to a different state in a Markov chain) and I am looking for transforms that would preserve the dominant eigenvector (the "stationary distribution" of the chain). What I want to do is to cause the antidiagonal of the matrix to be zero.

I remember studying a host of methods that would preserve the spectrum (e.g. QR method, Jacobi rotation, Householder matrices, etc.), but which methods preserve the dominant eigenvector?

Any suggestions?
 
Physics news on Phys.org
Supposing A \textbf{v} = \lambda \textbf{v}, where \textbf{v}, \lambda is the dominant eigenvector/eigenvalue pair with components v_1, v_2, ..., v_n. Then you could do something like
B = \lambda \left[\begin{matrix} 1 &amp; 0 &amp; 0 &amp; ... &amp; 0 \\ \frac{v_2}{v_1} &amp; 0 &amp; 0 &amp; ... &amp; 0<br /> \\ \frac{v_3}{v_1} &amp; 0 &amp; 0 &amp; ... &amp; 0 \\ \vdots &amp; \vdots &amp; \vdots &amp; \ddots &amp; 0 \\ \frac{v_{n-1}}{v_1} &amp; 0 &amp; 0 &amp; ... &amp; 0 \\ 0 &amp; \frac{v_n}{v_2} &amp; 0 &amp; ... &amp; 0 \end{matrix}\right]

I think B \textbf{v} = \lambda \textbf{v} if you work out the multiplication.
 
##\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...

Similar threads

  • Poll Poll
Replies
1
Views
5K
  • Poll Poll
Replies
1
Views
4K
Replies
5
Views
4K
Replies
9
Views
13K
Replies
13
Views
3K
Back
Top