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'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top