Do Markov Chain Transition Matrices Sum by Row or Column?

  • Thread starter Thread starter Jamin2112
  • Start date Start date
  • Tags Tags
    Chain Markov chain
Click For Summary
SUMMARY

The discussion clarifies that Markov Chain transition matrices typically sum by row, meaning that the sum of each row equals 1, representing the total probability of transitioning from a given state. While some sources, particularly from Asian literature, may use the column-sum convention, it is essential to adhere to the convention specified by the instructor. The conversation also highlights the importance of understanding the implications of these conventions when constructing and interpreting transition matrices.

PREREQUISITES
  • Understanding of Markov Chains and their properties
  • Familiarity with transition matrices
  • Basic probability theory
  • Knowledge of matrix operations and transposition
NEXT STEPS
  • Research the standard conventions in Markov Chain literature regarding transition matrices
  • Study the implications of matrix transposition on Markov Chain analysis
  • Learn how to construct and interpret transition matrices in practical scenarios
  • Explore algorithms related to Markov Chains, such as the power method for finding steady states
USEFUL FOR

Students studying probability theory, data scientists working with stochastic processes, and researchers analyzing Markov Chains will benefit from this discussion.

Jamin2112
Messages
973
Reaction score
12

Homework Statement



screen-capture-1-19.png


screen-capture-2-10.png


Homework Equations



screen-capture-3-16.png


The Attempt at a Solution




A few things.

First of all, the homework problem notes that "all the columns should sum to 1," whereas Wikipedia says ∑Pij = 1 when we sum all along the the row i.

Second of all, I don't know where to go after I've constructed my transition matrix. A hint would be much appreciated.
 
Physics news on Phys.org
Are you having problems with part b?

Basically you are interested in player 10 having a turn on turns 1-5 which means that you are interested in p_(x,5)^(n) where x is the initial state and n is the number of iterations. Based on that, what do you think you need to do (Remember in the homework forum, we can't do your work for you, but give you hints).

With regard to the sum of all elements along the rows being 1 that is correct. An easy way to think about this is that all probabilities in one row are those of disjoint events.

For example the probability p_(0,0) and p(0,1) are disjoint and all the probabilities of p(0,x) where x is any valid state must equal 1 because all possible probabilities starting from 0 and going to something else are considered and there can't be anymore.

Part c is more algorithmic and I'm sure you have the algorithm in your notes. Part d asks you to interpret your results from part c.
 
Jamin2112 said:

Homework Statement



screen-capture-1-19.png


screen-capture-2-10.png


Homework Equations



screen-capture-3-16.png


The Attempt at a Solution




A few things.

First of all, the homework problem notes that "all the columns should sum to 1," whereas Wikipedia says ∑Pij = 1 when we sum all along the the row i.

Second of all, I don't know where to go after I've constructed my transition matrix. A hint would be much appreciated.

The vast majority of books and papers use the standard convention in which rows sum to 1. However, I have seen a few papers (mostly from Asian sources) that take the other convention of having columns summing to 1. Basically, one matrix is just the transpose of the other. You should stick to whatever convention your instructor uses, at least when writing up the final solution.

RGV
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
24
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K