Search the whole station

# 代写数学作业 MATH 7241代写 数学作业代写 数学课业代写

354

## MATH 7241

### Problem Set #3 代写数学作业

Reading: relevant background material for these problems can be found in the class notes, and in Rosenthal Chapter 3.

Exercise 1

Let X1, X2,… be a sequence of random variables (not necessarily independent), and suppose that E[Xn] = 0 and E[(Xn)2] = 1 for all n 1. Prove that

P(Xn n i.o.)=0

where i.o. means ‘infinitely often’. [Hint: define the event An = {Xn n} and use the first Borel-Cantelli Lemma along with Markov’s inequality]

Exercise 2

Let X1, X2,… be independent random variables and suppose that Xn is uniform on the set {1, 2,…,n} for each n 1. Compute P(Xn =5 i.o.). [Hint: use the Borel-Cantelli Lemma]

### Problem Set #4 代写数学作业

Reading: relevant background material for these problems can be found on Canvas ‘Notes 4: Finite Markov Chains’. Also Grinstead and Snell Chapter 11.

Exercise 1 ‘Finite Markov Chains – Problems’, Exercise 4.

Hint: draw a graph with 6 nodes to represent the states of the chain, and draw a directed edge between each pair of nodes (i, j) for which the transition matrix entry pij is positive. You can identify the set of transient states as the group of nodes from which edges exit, but into which there are no entering edges. Once you find the transient states, the remaining states are all irreducible, and break up into subsets which intercommunicate.

Exercise 2 ‘Finite Markov Chains – Problems’, Exercises 5 a), 5 b).

Exercise 3 ‘Finite Markov Chains – Problems’, Exercise 2.

Hint: to represent this by a Markov chain you must use the result of two successive trials as your state. So there are four states: SS, SF, F S, F F where S is success and F is failure, and SF means success on trial n and failure on trial n + 1. Then if your current state is SF, your next state must be either F S or F F.

*Exercise 4 ‘Finite Markov Chains – Problems’ file: Exercise 3

Exercise 4 Grinstead & Snell, p. 442: #2.

Note: see pages 442-443 from Grinstead and Snell on Canvas. The text is available online (free!) at

http://www.dartmouth.edu/chance/

Click on the link “A GNU book”.

The next:

### Related recommendations

• #### 图论代写 Graph Theory代写 Assignment代写

891

MT4514 Graph Theory Assignment 1 图论代写 This assignment forms 5% of the assessment for this module. The assignment will be marked out of 20 marks. Please answer all questions, This assi...

View details
• #### 数学概率作业代写 数学概率代写 数学作业代写 概率作业代写

357

4. Probability on finite sample spaces. 数学概率作业代写 1. Are the following events A, B ⊂ Ωroulette independent? Find P(A|B) and P(B|A) in each case. a) A = Red, B = Even, 1. Are the fol...

View details
• #### 数学考试代做 Math 2415代写 数学期末代写 数学作业代写

562

Math 2415 Final Exam 数学考试代做 To get full credit you must show ALL your work. The problems must be solved without any assistance of others or the usage of unauthorized material To get fu...

View details
• #### 半群理论作业代做 MT5863代写 半群理论代写 数学作业代写

346

MT5863 Semigroup theory: Problem sheet 3 半群理论作业代做 Binary relations and equivalences 3-1. Let X = {1, 2, 3, 4, 5, 6}, let ρ be the equivalence relation on X with equivalence classes {1,...

View details
1