Question
Let and . Let be random variables taking values in such that
The above holds for any sequence taking values ; here is a normalizing constant ensuring has total mass 1 ( does not depend on ).
(a) Prove that form a Markov chain.
(b) Compute its transition probabilities.
(c) Compute .
Step-by-step solution
Step 1. (a) Prove that form a Markov chain. To verify the Markov property: From the joint distribution: The conditional probability is: This depends only on and , not on , so the Markov property holds.
(b) The transition probability is where , giving . Thus:
(c) The one-step conditional expectation is . By iteration, . Since :
Final answer
(a) QED. (b) (c)
Marking scheme
The following is the rubric for this discrete probability / Ising model problem.
1. Checkpoints (max 7 pts total)
(a) Prove the Markov chain property (2 pts)
- Using the conditional probability definition, write and show terms for cancel: 1 pt
- Assert the conditional probability is independent of : 1 pt
(b) Compute transition probabilities (2 pts)
- Identify unnormalized form proportional to : 1 pt
- Compute normalizing constant and write final formula: 1 pt
(c) Compute (3 pts)
Score exactly one chain:
- Chain A: Matrix eigenvalue method
- Find nontrivial eigenvalue : 1 pt
- Derive -step transition property: 1 pt
- Obtain final result : 1 pt
- Chain B: Recursive conditional expectation
- Compute : 1 pt
- Iterate to get : 1 pt
- Use and : 1 pt
Total (max 7)
2. Zero-credit items
- (a) Merely citing a theorem name without derivation from the given joint distribution.
- (c) Guessing the result without derivation.
- (c) Merely listing the expectation definition without simplification.
3. Deductions
- Exponent error (-1): Confusing with in the final result.
- Variable confusion (-1): Confusing (random variables) with (realizations).
- Constant not simplified (no deduction): Using form instead of hyperbolic functions.
- Sign error (score cap): If eigenvalue is or divergent, cap at 1/3.