MHB Need Help with University Question? Let's Discuss!

  • Thread starter Thread starter saifh
  • Start date Start date
  • Tags Tags
    University
saifh
Messages
4
Reaction score
0
Hi there,

I'm currently doing one of the questions off a practice sheet given to us at uni, however am stuck due to not fully understanding the concept of the question. I've tried attempting it different ways but just cannot find a place to start. Can anyone please help me out here? I've uploaded the question as an image:

View attachment 4823
Thanks!
 

Attachments

  • 2003help.JPG
    2003help.JPG
    17.9 KB · Views: 85
Physics news on Phys.org
Hi saifh, and welcome to MHB!

Think of the matrix $\mathbf{P}$ like this: $$\begin{matrix}&&\text{from} \\ &&\begin{matrix}1\;\; &2&\;\; 3\end{matrix} \\ \text{to} & \begin{matrix}1 \\ 2\\ 3\end{matrix} & \begin{bmatrix}0.5 & 0.4 & 0.6 \\ 0.2&0.2 & 0.3 \\ 0.3 & 0.4 & 0.1\end{bmatrix} \end{matrix}.$$ In other words, the rows and columns are each numbered by the three states $1$, $2$, $3$, and the element in row $i$ and column $j$ of the matrix represents the probability of transition from state $j$ to state $i$. So for example $\mathbf{P}_{2,1}$, the element in row $2$ and column $1$ (which is equal to $0.2$) tells you the probability of transition from state $1$ to state $2$. That should be enough help for you to do part (i).

For part (ii), draw a diagram with three regions labelled $1$, $2$, $3$ and link them with arrows going from each region to each region (including circular arrows going from a region to itself). Then label each arrow with the probability of transition from the state at the tail of the arrow to the to state at the head of the arrow.

For (iii), look in your notes or textbook to see the definitions of regular and stochastic, and check that the matrix $\mathbf{P}$ satisfies them.
 
Opalg said:
Hi saifh, and welcome to MHB!

Think of the matrix $\mathbf{P}$ like this: $$\begin{matrix}&&\text{from} \\ &&\begin{matrix}1\;\; &2&\;\; 3\end{matrix} \\ \text{to} & \begin{matrix}1 \\ 2\\ 3\end{matrix} & \begin{bmatrix}0.5 & 0.4 & 0.6 \\ 0.2&0.2 & 0.3 \\ 0.3 & 0.4 & 0.1\end{bmatrix} \end{matrix}.$$ In other words, the rows and columns are each numbered by the three states $1$, $2$, $3$, and the element in row $i$ and column $j$ of the matrix represents the probability of transition from state $j$ to state $i$. So for example $\mathbf{P}_{2,1}$, the element in row $2$ and column $1$ (which is equal to $0.2$) tells you the probability of transition from state $1$ to state $2$. That should be enough help for you to do part (i).

For part (ii), draw a diagram with three regions labelled $1$, $2$, $3$ and link them with arrows going from each region to each region (including circular arrows going from a region to itself). Then label each arrow with the probability of transition from the state at the tail of the arrow to the to state at the head of the arrow.

For (iii), look in your notes or textbook to see the definitions of regular and stochastic, and check that the matrix $\mathbf{P}$ satisfies them.

Cheers for the help, I'll reply back here or PM if I still can't do this.
 
##\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