Math 544, Assignment 1
Due 2013-09-17, 11:00
Problem 1. Prove the inclusion-exclusion principle. Bonus: Show that partial sums are
alternate upper and lower bounds for P(Ai ).
Problem 2. A -algebra F
MATH 418/544, Assignment 7 solutions
1
Problem 1. If S, T are stopping times and m > 0 is xed, determine which
of the following are stopping times: T m, T m, S T , S T , T + m,
T + S, T m, T + m.
Solu
MATH 544, Assignment 8 solutions
1
Problem 1. Consider a random walk on Z with increments Xi that are some
bounded random variable. Suppose P(X > 0) and P(X < 0) are non-zero, and
EX = 0. Show that th
MATH 544, Assignment 7 solutions
1
Problem 1. If S, T are stopping times and m > 0 is xed, determine which
of the following are stopping times: T m, T m, S T , S T , T + m,
T + S, T m, T + m.
Solution
MATH 544, Assignment 7
Due 2014-11-26, 10:00
Problem 1. If S, T are stopping times and m > 0 is xed, determine which
of the following are stopping times: T m, T m, S T , S T , T + m,
T + S, T m, T + m
MATH 544, Assignment 8
Due 2014-12-02
Problem 1. Consider a random walk on Z with increments Xi that are some
bounded random variable. Suppose P(X > 0) and P(X < 0) are non-zero, and
EX = 0. Show that
MATH 544, Assignment 6 solutions
1
Problem 1. Prove that X is periodic if and only if X takes values in aZ
(multiples of a) for some a.
solution. If (t) = (0) = 1, then EeitX = 1. This can only happen
Math 544, Assignment 4
Due 2013-10-22, 11:00
Problem 1. For given p, construct a tree where pc = p and (pc ) > 0.
Problem 2. Find variables Xn , all with mean 0, variance 1 and P(|Xn | > 0.1) 0.
Probl
MATH 544, Assignment 5
Due 2014-11-05, 10:00
Problem 1. a. If Xn X and Yn Y in probability show that Xn + Yn
X + Y in probability.
b. Do the same for convergence in L1 . c. Show this fails for conver
Math 544, Assignment 3
Due 2013-10-08, 11:00
Denition 1. The m-ary tree is a graph with a single vertex on level 0, and each vertex on
level k has m edges to vertices on level k + 1, all distinct (so
MATH 544, Assignment 6
Due 2014-11-12, 10:00
Problem 1. Prove that X is periodic if and only if X takes values in aZ
(multiples of a) for some a.
Problem 2. Use characteristic functions to prove the w
Math 544, Assignment 2
Due 2013-10-01, 11:00
Problem 1. nd n events so that any n 1 are independent but all together are not.
Problem 2. In the previous problem, show that | 2n1
Problem 3. a. Let (Ai
Math 544, Assignment 4 solutions
Problem 1. For given p, construct a tree where pc = p and (pc ) > 0.
Consider a symmetric tree, where a vetex at level k has dk children, so that level n has
volume Vn
MATH 418/544, Assignment 8 solutions
1
Problem 1. Consider a random walk on Z with increments Xi that are some
bounded random variable. Suppose P(X > 0) and P(X < 0) are non-zero, and
EX = 0. Show tha
Math 544, Assignment 1 solutions
Problem 1. Prove the inclusion-exclusion principle. Bonus: Show that partial sums are
alternate upper and lower bounds for P(Ai ).
We write the principle as
(1)|S| P(i
MATH 544, Assignment 5
Due 2014-11-05, 10:00
Problem 1. a. If Xn X and Yn Y in probability show that Xn + Yn
X + Y in probability.
b. Do the same for convergence in L1 . c. Show this fails for conver
Math 544, Assignment 3
Due 2013-10-08, 11:00
Denition 1. The m-ary tree is a graph with a single vertex on level 0, and each vertex on
level k has m edges to vertices on level k + 1, all distinct (so
MATH 418/544, Assignment 6 solutions
1
Problem 1. Prove that X is periodic if and only if X takes values in aZ
(multiples of a) for some a.
solution. If (t) = (0) = 1, then EeitX = 1. This can only ha
Math 544, Assignment 2 solutions
Problem 1. nd n events so that any n 1 are independent but all together are not.
Consider n 1 independent fair coins, and let the events be that coin i is heads, and
t