Stat 8273, Spring 2016
Homework 2
Due Tue, Feb/16, at the beginning of class
1. The goal for this problem is to prove the following result from class:
Theorem. Suppose that for each n N, the random va
Stat 8273, Spring 2014
Homework 5
Due Tue, Mar 8, at the beginning of class
Suppose we have a sequence of random variables (Xn ) with limit X := limn Xn .
Often it is easy to calculate the expectation
Stat 8273, Spring 2016
Homework 6
Due Tue, Apr 12, at the beginning of class
1. Consider an ordinary arithmetic renewal process with span = 1, inter-arrival
times Xi 1, and := E[X1 ] < . Let R(m) := S
Stat 8273, Spring 2016
Homework 3
Due Tue, Feb 23, at the beginning of class
Review section 1.5 in our textbook on conditional expectation.
1. Question 2.4 on page 89 in our textbook by Ross.
Hint: Co
Stat 8273, Spring 2016
Homework 4
Due Tue, Mar 1, at the beginning of class
1. Suppose (Nt : t > 0) and (Mt : t > 0) are independent Poisson counting processes
with rates and , respectively. Let := in
Stat 8273, Spring 2016
Homework 7
Due Tue, Apr 19, at the beginning of class
1. Is p q random walk on Z is irreducible? Prove your answer.
P
2. Let Sn := ni=1 Xi be the event times of an ordinary arit
Stat 8273, Spring 2016
Homework 8
Due Tue, Apr 26
1. The goal in this problem is to prove that simple random walk on the integers
is null recurrent. (We proved in class that it is recurrent.) Note tha
Stat 8273, Fall 2016
Homework 1
Due Tue, Jan 26, at the beginning of class
Definition. Let f, g be two real valued functions. We say that f (x) is (in) Big-Oh of
g(x), denoted by f (x) = O g(x) , as x