Markov chain, sum of N dice rolls

AI Thread Summary
The discussion centers on proving that the maximum score obtained after n throws of a fair die, denoted as Xn, is a Markov chain and determining its transition matrix. Participants clarify that the states refer to the maximum score rather than the sum of the rolls. The transition matrix is described as an upper triangular matrix with specific diagonal entries representing the probabilities of moving to each state. There is a correction regarding the terminology, emphasizing that while the transition matrix can be raised to a power for analysis, it is not a function of n itself. The conversation concludes with a confirmation of the correct structure of the transition matrix.
simba_
Messages
19
Reaction score
0
Question : Let Xn be the maximum score obtained after n throws of a fair dice

a) Prove that Xn is a markov chain and write down the transition matrix

Im having a problem starting the transition matrix

im assuming the states are meant to be the sum. then do you write out the transition matrix for the first 2 throws and have this matrix to the power of n-1?
 
Physics news on Phys.org
simba_ said:
im assuming the states are meant to be the sum

I suppose if you are studying markov chains with an infinite number of states, you could try interpreting "maximum score" to mean some sort of sum. However, it seems to me that the problem intends the state of the process on the nth roll to be max \{ R_1,R_2,...R_n\} and not R_1 + R_2 + ... + R_n. So if make 3 rolls and they are {3,5,4} the state of the process is X_3 = 5
 
Thanks for your reply, that makes sense.

So the transition matrix is an upper triangular matrix to the power of n-1 with the diagonal entries 1/6, 2/6, 3/6, 4/6, 5/6, 6/6 respectively?
 
simba_ said:
So the transition matrix is an upper triangular matrix to the power of n-1
That is incorrect terminology. To compute things about the state at step n in the process, one may raise the transition matrix to a power, but the transition matrix itself, in simple examples, is not a function of n.

with the diagonal entries 1/6, 2/6, 3/6, 4/6, 5/6, 6/6 respectively?

Yes.
 
Thank you for your help
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top