STAT 333 Assignment 3

STAT 333 Assignment 3 - STAT 333 Assignment 3 Due: Monday...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
STAT 333 Assignment 3 Due: Monday April 2 at the beginning of class 1. At all times, a container holds a mixture of N balls, some white and the rest black. At each step, a coin having probability p, 0 < p < 1, of landing heads is tossed. If it is heads, a ball is chosen at random from the container and replaced by a white ball; if it is tails, a ball is chosen at random from the container and replaced by a black ball. Let X n denote the number of white balls in the container after the n th coin toss. a. Is {X n } a Markov Chain? If so, explain why. b. What are its classes? What are their periods? Are they transient or recurrent? c. Compute the transition probabilities p ij . d. Let N = 2. Find the limiting proportion of time that {X n } spends in each state. e. Based on your answer in part (d) and your intuition, guess the answer for the limiting probability when N is any positive integer. f. Prove your guess in part (e) by showing that the equilibrium equations are satisfied. g.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/30/2012 for the course STAT 333 taught by Professor Chisholm during the Winter '08 term at Waterloo.

Page1 / 2

STAT 333 Assignment 3 - STAT 333 Assignment 3 Due: Monday...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online