Section 7.11

Problems

[41/100%]
Show
LaTeX
Problem 7.11.1

Let XnX_{n} have density function

fn(x)=nπ(1+n2x2),n≥1 f_{n}(x) = \frac{n}{\pi \left(1+n^{2} x^{2}\right)}, \quad n \geq 1

With respect to which modes of convergence does XnX_{n} converge as n→∞n \rightarrow \infty?

?
Problem 7.11.2

(i) Suppose that Xn→ a.s. XX_{n} \xrightarrow {\text{ a.s. }} X and Yn→ a.s. YY_{n} \xrightarrow {\text{ a.s. }} Y.

?
(a)

Show that Xn+Yn→ a.s. X+YX_{n}+Y_{n} \xrightarrow {\text{ a.s. }} X+Y.

(b)

Show that the corresponding result holds for convergence in rrth mean.

(c)

Show that the corresponding result holds for convergence in probability.

(d)

Show that the corresponding result does not, in general, hold for convergence in distribution.

Show that if Xn→ a.s. XX_{n} \xrightarrow {\text{ a.s. }} X and Yn→ a.s. YY_{n} \xrightarrow {\text{ a.s. }} Y then XnYn→ a.s. XYX_{n} Y_{n} \xrightarrow {\text{ a.s. }} X Y. Does the corresponding result hold for the other modes of convergence?

Problem 7.11.3

Let g:R→Rg: \mathbb {R} \rightarrow \mathbb {R} be continuous. Show that g(Xn)→Pg(X)g\left(X_{n}\right) \xrightarrow {\mathrm{P}} g(X) if Xn→PXX_{n} \xrightarrow {\mathrm{P}} X.

?
Problem 7.11.4

Let Y1,Y2,…Y_{1}, Y_{2}, \ldots be independent identically distributed variables, each of which can take any value in {0,1,…,9}\left\{ 0,1, \ldots , 9\right\} with equal probability 110\frac{1}{10}. Let Xn=∑i=1nYi10−iX_{n} = \sum_{i = 1}^{n} Y_{i} 10^{-i}. Show by the use of characteristic functions that XnX_{n} converges in distribution to the uniform distribution on [0, 1]. Deduce that Xn→ a.s. YX_{n} \xrightarrow {\text{ a.s. }} Y for some YY which is uniformly distributed on [0,1][0,1].

?
Problem 7.11.5

Let N(t)N(t) be a Poisson process with constant intensity on R\mathbb {R}.

?
(a)

Find the covariance of N(s)N(s) and N(t)N(t).

(b)

Show that NN is continuous in mean square, which is to say that E[{N(t+h)−N(t)}2]→0\mathbb {E}\left[\left\{ N(t+h)-N(t)\right\}^{2}\right] \rightarrow 0 as h→0h \rightarrow 0.

(c)

Prove that NN is continuous in probability, which is to say that P(∣N(t+h)−N(t)∣>ϵ)→0\mathbb {P}\left(\left|N(t+h)-N(t)\right| > \epsilon \right) \rightarrow 0 as h→0h \rightarrow 0, for all ϵ>0\epsilon > 0.

(d)

Show that NN is differentiable in probability but not in mean square.

Problem 7.11.6

Prove that n−1∑i=1nXi→ a.s. 0n^{-1} \sum_{i = 1}^{n} X_{i} \xrightarrow {\text{ a.s. }} 0 whenever the XiX_{i} are independent identically distributed variables with zero means and such that E[X14]<∞\mathbb {E}\left[X_{1}^{4}\right] < \infty.

?
Problem 7.11.7

Show that Xn→ a.s. XX_{n} \xrightarrow {\text{ a.s. }} X whenever ∑nE[∣Xn−X∣r]<∞\sum_{n} \mathbb {E}\left[\left|X_{n}-X\right|^{r}\right] < \infty for some r>0r > 0.

?
Problem 7.11.8

Show that if Xn→DXX_{n} \xrightarrow {\mathrm{D}} X then aXn+b→DaX+ba X_{n}+b \xrightarrow {\mathrm{D}} a X+b for any real aa and bb.

?
Problem 7.11.9
?
(a)

Cantelli, or one-sided Chebyshov inequality. If XX has zero mean and variance σ2>0\sigma^{2} > 0, show that

P(X≥t)≤σ2σ2+t2 for t>0 \mathbb {P}\left(X \geq t\right) \leq \frac{\sigma ^{2}}{\sigma ^{2}+t^{2}} \quad \text{ for } t > 0
(b)

Deduce that ∣μ−m∣≤σ\left|\mu -m\right| \leq \sigma, where μ\mu, mm, and σ(>0)\sigma ( > 0) are the mean, median, and standard deviation of a given distribution.

(c)

Use Jensen's inequality to prove part (b) directly.

Problem 7.11.10

Show that Xn→P0X_{n} \xrightarrow {\mathrm{P}} 0 if and only if

E[∣Xn∣1+∣Xn∣]→0 as n→∞ \mathbb {E}\left[\frac{\left|X_{n}\right|}{1+\left|X_{n}\right|}\right] \rightarrow 0 \quad \text{ as } n \rightarrow \infty
?
Problem 7.11.11

The sequence {Xn}\left\{ X_{n}\right\} is said to be mean-square Cauchy convergent if E[(Xn−Xm)2]→0\mathbb {E}\left[\left(X_{n}-X_{m}\right)^{2}\right] \rightarrow 0 as m,n→∞m, n \rightarrow \infty. Show that {Xn}\left\{ X_{n}\right\} converges in mean square to some limit XX if and only if it is mean-square Cauchy convergent. Does the corresponding result hold for the other modes of convergence?

?
Problem 7.11.12

Suppose that {Xn}\left\{ X_{n}\right\} is a sequence of uncorrelated variables with zero means and uniformly bounded variances. Show that n−1∑i=1nXi→ m.s. 0n^{-1} \sum_{i = 1}^{n} X_{i} \xrightarrow {\text{ m.s. }} 0.

?
Problem 7.11.13

Let X1,X2,…X_{1}, X_{2}, \ldots be independent identically distributed random variables with the common distribution function FF, and suppose that F(x)<1F(x) < 1 for all xx. Let Mn=max⁡{X1,X2,…,Xn}M_{n} = \max \left\{ X_{1}, X_{2}, \ldots , X_{n}\right\} and suppose that there exists a strictly increasing unbounded positive sequence a1,a2,…a_{1}, a_{2}, \ldots such that P(Mn/an≤x)→H(x)\mathbb {P}\left(M_{n} / a_{n} \leq x\right) \rightarrow H(x) for some distribution function HH. Let us assume that HH is continuous with 0<H(1)<10 < H(1) < 1; substantially weaker conditions suffice but introduce extra difficulties.

?
(a)

Show that n[1−F(anx)]→−log⁡H(x)n\left[1-F\left(a_{n} x\right)\right] \rightarrow -\log H(x) as n→∞n \rightarrow \infty and deduce that

1−F(anx)1−F(an)→log⁡H(x)log⁡H(1) if x>0 \frac{1-F\left(a_{n} x\right)}{1-F\left(a_{n}\right)} \rightarrow \frac{\log H(x)}{\log H(1)} \quad \text{ if } x > 0
(b)

Deduce that if x>0x > 0

1−F(tx)1−F(t)→log⁡H(x)log⁡H(1) as t→∞ \frac{1-F(t x)}{1-F(t)} \rightarrow \frac{\log H(x)}{\log H(1)} \quad \text{ as } t \rightarrow \infty
(c)

Set x=x1x2x = x_{1} x_{2} and make the substitution

g(x)=log⁡H(ex)log⁡H(1) g(x) = \frac{\log H\left(e^{x}\right)}{\log H(1)}

to find that g(x+y)=g(x)g(y)g(x+y) = g(x) g(y), and deduce that

H(x)={exp⁡(−αx−β) if x≥00 if x<0 H(x) = \begin{cases} \exp \left(-\alpha x^{-\beta }\right) & \text{ if } x \geq 0 \\ 0 & \text{ if } x < 0\end{cases}

for some non-negative constants α\alpha and β\beta. You have shown that HH is the distribution function of Y−1Y^{-1}, where YY has a Weibull distribution.

Problem 7.11.14

Let X1,X2,…,XnX_{1}, X_{2}, \ldots , X_{n} be independent and identically distributed random variables with the Cauchy distribution. Show that Mn=max⁡{X1,X2,…,Xn}M_{n} = \max \left\{ X_{1}, X_{2}, \ldots , X_{n}\right\} is such that πMn/n\pi M_{n} / n converges in distribution, the limiting distribution function being given by H(x)=e−1/xH(x) = e^{-1 / x} if x≥0x \geq 0.

?
Problem 7.11.15

Let X1,X2,…X_{1}, X_{2}, \ldots be independent and identically distributed random variables whose common characteristic function ϕ\phi satisfies ϕ′(0)=iμ\phi^{\prime }(0) = i \mu. Show that n−1∑j=1nXj→Pμn^{-1} \sum_{j = 1}^{n} X_{j} \xrightarrow {\mathrm{P}} \mu.

?
Problem 7.11.16

The total variation distance dTV(X,Y)d_{\mathrm{TV}}(X, Y) between two random variables XX and YY is defined by

dTV(X,Y)=sup⁡u:∥u∥∞=1∣E[u(X)]−E[u(Y)]∣ d_{\mathrm{TV}}(X, Y) = \sup _{u:\left\| u\right\| _{\infty } = 1}\left|\mathbb {E}\left[u(X)\right]-\mathbb {E}\left[u(Y)\right]\right|

where the supremum is over all (measurable) functions u:R→Ru: \mathbb {R} \rightarrow \mathbb {R} such that ∥u∥∞=sup⁡x∣u(x)∣\left\| u\right\|_{\infty } = \sup_{x}\left|u(x)\right| satisfies ∥u∥∞=1\left\| u\right\|_{\infty } = 1.

?
(a)

If XX and YY are discrete with respective masses fnf_{n} and gng_{n} at the points xnx_{n}, show that

dTV(X,Y)=∑n∣fn−gn∣=2sup⁡A⊆R∣P(X∈A)−P(Y∈A)∣ d_{\mathrm{TV}}(X, Y) = \sum _{n}\left|f_{n}-g_{n}\right| = 2 \sup _{A \subseteq \mathbb {R}}\left|\mathbb {P}\left(X \in A\right)-\mathbb {P}\left(Y \in A\right)\right|
(b)

If XX and YY are continuous with respective density functions ff and gg, show that

dTV(X,Y)=∫−∞∞∣f(x)−g(x)∣dx=2sup⁡A⊆R∣P(X∈A)−P(Y∈A)∣ d_{\mathrm{TV}}(X, Y) = \int _{-\infty }^{\infty }\left|f(x)-g(x)\right| d x = 2 \sup _{A \subseteq \mathbb {R}}\left|\mathbb {P}\left(X \in A\right)-\mathbb {P}\left(Y \in A\right)\right|
(c)

Show that dTV(Xn,X)→0d_{\mathrm{TV}}\left(X_{n}, X\right) \rightarrow 0 implies that Xn→XX_{n} \rightarrow X in distribution, but that the converse is false.

(d)

Maximal coupling. Show that P(X≠Y)≥12dTV(X,Y)\mathbb {P}\left(X \neq Y\right) \geq \frac{1}{2} d_{\mathrm{TV}}(X, Y), and that there exists a pair X′,Y′X^{\prime }, Y^{\prime } having the same marginals for which equality holds.

(e)

If Xi,YjX_{i}, Y_{j} are independent random variables, show that

dTV(∑i=1nXi,∑i=1nYi)≤∑i=1ndTV(Xi,Yi) d_{\mathrm{TV}}\left(\sum _{i = 1}^{n} X_{i}, \sum _{i = 1}^{n} Y_{i}\right) \leq \sum _{i = 1}^{n} d_{\mathrm{TV}}\left(X_{i}, Y_{i}\right)
Problem 7.11.17

Let g:R→Rg: \mathbb {R} \rightarrow \mathbb {R} be bounded and continuous. Show that

∑k=0∞g(k/n)(nλ)kk!e−nλ→g(λ) as n→∞ \sum _{k = 0}^{\infty } g(k / n) \frac{(n \lambda )^{k}}{k!} e^{-n \lambda } \rightarrow g(\lambda ) \quad \text{ as } n \rightarrow \infty
?
Problem 7.11.18

Let XnX_{n} and YmY_{m} be independent random variables having the Poisson distribution with parameters nn and mm, respectively. Show that

(Xn−n)−(Ym−m)Xn+Ym→DN(0,1) as m,n→∞ \frac{\left(X_{n}-n\right)-\left(Y_{m}-m\right)}{\sqrt{X_{n}+Y_{m}}} \xrightarrow {\mathrm{D}} N(0,1) \quad \text{ as } m, n \rightarrow \infty
?
Problem 7.11.19
?
(a)

Suppose that X1,X2,…X_{1}, X_{2}, \ldots is a sequence of random variables, each having a normal distribution, and such that Xn→DXX_{n} \xrightarrow {\mathrm{D}} X. Show that XX has a normal distribution, possibly degenerate.

(b)

For each n≥1n \geq 1, let (Xn,Yn)\left(X_{n}, Y_{n}\right) be a pair of random variables having a bivariate normal distribution. Suppose that Xn→PXX_{n} \xrightarrow {\mathrm{P}} X and Yn→PYY_{n} \xrightarrow {\mathrm{P}} Y, and show that the pair (X,Y)(X, Y) has a bivariate normal distribution.

Problem 7.11.20

Let X1,X2,…X_{1}, X_{2}, \ldots be random variables satisfying Var⁡[Xn]<c\operatorname {Var}\left[X_{n}\right] < c for all nn and some constant cc. Show that the sequence obeys the weak law, in the sense that n−1∑1n(Xi−E[Xi])n^{-1} \sum_{1}^{n}\left(X_{i}-\mathbb {E}\left[X_{i}\right]\right) converges in probability to 00, if the correlation coefficients satisfy either of the following:

(i) ρ(Xi,Xj)≤0\rho \left(X_{i}, X_{j}\right) \leq 0 for all i≠ji \neq j,

(ii) ρ(Xi,Xj)→0\rho \left(X_{i}, X_{j}\right) \rightarrow 0 as ∣i−j∣→∞\left|i-j\right| \rightarrow \infty.

?
Problem 7.11.21

Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables with common density function

f(x)={0 if ∣x∣≤2cx2log⁡∣x∣ if ∣x∣>2 f(x) = \begin{cases} 0 & \text{ if }\left|x\right| \leq 2 \\ \frac{c}{x^{2} \log \left|x\right|} & \text{ if }\left|x\right| > 2\end{cases}

where cc is a constant. Show that the XiX_{i} have no mean, but n−1∑i=1nXi→P0n^{-1} \sum_{i = 1}^{n} X_{i} \xrightarrow {\mathrm{P}} 0 as n→∞n \rightarrow \infty. Show that convergence does not take place almost surely.

?
Problem 7.11.22

Let XnX_{n} be the Euclidean distance between two points chosen independently and uniformly from the nn-dimensional unit cube. Show that E[Xn]/n→1/6\mathbb {E}\left[X_{n}\right] / \sqrt{n} \rightarrow 1 / \sqrt{6} as n→∞n \rightarrow \infty.

?
Problem 7.11.23

Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables having the uniform distribution on [−1,1][-1,1]. Show that

P(∣∑i=1nXi−1∣>12nπ)→12 as n→∞ \mathbb {P}\left(\left|\sum _{i = 1}^{n} X_{i}^{-1}\right| > \frac{1}{2} n \pi \right) \rightarrow \frac{1}{2} \quad \text{ as } n \rightarrow \infty
?
Problem 7.11.24

Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables, each XkX_{k} having mass function given by

P(Xk=k)=P(Xk=−k)=12k2P(Xk=1)=P(Xk=−1)=12(1−1k2) if k>1 \begin{aligned} & \mathbb {P}\left(X_{k} = k\right) = \mathbb {P}\left(X_{k} = -k\right) = \frac{1}{2 k^{2}} \\ & \mathbb {P}\left(X_{k} = 1\right) = \mathbb {P}\left(X_{k} = -1\right) = \frac{1}{2}\left(1-\frac{1}{k^{2}}\right) \quad \text{ if } k > 1 \end{aligned}

Show that Un=∑1nXiU_{n} = \sum_{1}^{n} X_{i} satisfies Un/n→DN(0,1)U_{n} / \sqrt{n} \xrightarrow {\mathrm{D}} N(0,1) but Var⁡[Un/n]→2\operatorname {Var}\left[U_{n} / \sqrt{n}\right] \rightarrow 2 as n→∞n \rightarrow \infty.

?
Problem 7.11.25

Let X1,X2,…X_{1}, X_{2}, \ldots be random variables, and let N1,N2,…N_{1}, N_{2}, \ldots be random variables taking values in the positive integers such that Nk→P∞N_{k} \xrightarrow {\mathrm{P}} \infty as k→∞k \rightarrow \infty. Show that:

(i) if Xn→DXX_{n} \xrightarrow {\mathrm{D}} X and the XnX_{n} are independent of the NkN_{k}, then XNk→DXX_{N_{k}} \xrightarrow {\mathrm{D}} X as k→∞k \rightarrow \infty,

(ii) if Xn→ a.s. XX_{n} \xrightarrow {\text{ a.s. }} X then XNk→PXX_{N_{k}} \xrightarrow {\mathrm{P}} X as k→∞k \rightarrow \infty.

?
Problem 7.11.26
?
(a)

Let a(k,n)=nk/(k−1)a(k, n) = n^{k} /(k-1) ! for 1≤k≤n+11 \leq k \leq n+1. Use the fact that 1−x≤e−x1-x \leq e^{-x} if x≥0x \geq 0 to show that

a(n−k,n)a(n+1,n)≤e−k2/(2n) if k≥0 \frac{a(n-k, n)}{a(n+1, n)} \leq e^{-k^{2} /(2 n)} \quad \text{ if } k \geq 0
(b)

Let X1,X2,…X_{1}, X_{2}, \ldots be independent Poisson variables with parameter 1, and let Sn=X1+⋯+XnS_{n} = X_{1}+\cdots +X_{n}. Define the function g:R→Rg: \mathbb {R} \rightarrow \mathbb {R} by

g(x)={−x if 0≥x≥−M0 otherwise  g(x) = \begin{cases} -x & \text{ if } 0 \geq x \geq -M \\ 0 & \text{ otherwise }\end{cases}

where MM is large and positive. Show that, for large nn,

E[g{Sn−nn}]=e−nn{a(n+1,n)−a(n−k,n)} \mathbb {E}\left[g\left\{ \frac{S_{n}-n}{\sqrt{n}}\right\} \right] = \frac{e^{-n}}{\sqrt{n}}\left\{ a(n+1, n)-a(n-k, n)\right\}

where k=⌊Mn1/2⌋k = \left\lfloor M n^{1 / 2}\right\rfloor.

(c)

Now use the central limit theorem and (a) above, to deduce Stirling's formula:

n!ennn+122π→1 as n→∞ \frac{n!e^{n}}{n^{n+\frac{1}{2}} \sqrt{2 \pi }} \rightarrow 1 \quad \text{ as } n \rightarrow \infty
Problem 7.11.27

A bag contains red and green balls. A ball is drawn from the bag, its colour noted, and then it is returned to the bag together with a new ball of the same colour. Initially the bag contained one ball of each colour. If RnR_{n} denotes the number of red balls in the bag after nn additions, show that Sn=Rn/(n+2)S_{n} = R_{n} /(n+2) is a martingale. Deduce that the ratio of red to green balls converges almost surely to some limit as n→∞n \rightarrow \infty.

?
Problem 7.11.28

Let {Xi:i≥1}\left\{ X_{i}: i \geq 1\right\} be independent identically distributed random variables with zero mean and finite positive variance σ2\sigma^{2}, and let Sn=∑1nXiS_{n} = \sum_{1}^{n} X_{i}. Suppose that the integer-valued random process M(t)M(t) satisfies t−1M(t)→Pθt^{-1} M(t) \xrightarrow {\mathrm{P}} \theta as t→∞t \rightarrow \infty, where θ\theta is a positive constant. Show that

SM(t)σθt→DN(0,1) and SM(t)σM(t)→DN(0,1) as t→∞. \frac{S_{M(t)}}{\sigma \sqrt{\theta t}} \xrightarrow {\mathrm{D}} N(0,1) \quad \text{ and } \quad \frac{S_{M(t)}}{\sigma \sqrt{M(t)}} \xrightarrow {\mathrm{D}} N(0,1) \quad \text{ as } t \rightarrow \infty .

You should not assume that the process MM is independent of the XiX_{i}.

?
Problem 7.11.29

Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables with zero means, and Sn=X1+X2+⋯+XnS_{n} = X_{1}+X_{2}+\cdots +X_{n}. Let Mn=max⁡1≤k≤n∣Sk∣M_{n} = \max_{1 \leq k \leq n}\left|S_{k}\right| and show that E[Sn2IAk]>c2P(Ak)\mathbb {E}\left[S_{n}^{2} I_{A_{k}}\right] > c^{2} \mathbb {P}\left(A_{k}\right) where Ak={Mk−1≤c<Mk}A_{k} = \left\{ M_{k-1} \leq c < M_{k}\right\} and c>0c > 0. Deduce Kolmogorov's inequality:

P(max⁡1≤k≤n∣Sk∣>c)≤E[Sn2]c2,c>0. \mathbb {P}\left(\max _{1 \leq k \leq n}\left|S_{k}\right| > c\right) \leq \frac{\mathbb {E}\left[S_{n}^{2}\right]}{c^{2}}, \quad c > 0.
?
Problem 7.11.30

Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables with zero means, and let Sn=X1+X2+⋯+XnS_{n} = X_{1}+X_{2}+ \cdots +X_{n}. Using Kolmogorov's inequality or the martingale convergence theorem, show that:

(i) ∑i=1∞Xi\sum_{i = 1}^{\infty } X_{i} converges almost surely if ∑k=1∞E[Xk2]<∞\sum_{k = 1}^{\infty } \mathbb {E}\left[X_{k}^{2}\right] < \infty,

(ii) if there exists an increasing real sequence (bn)(b_{n}) such that bn→∞b_{n} \rightarrow \infty, and satisfying the inequality ∑k=1∞E[Xk2]/bk2<∞\sum_{k = 1}^{\infty } \mathbb {E}\left[X_{k}^{2}\right] / b_{k}^{2} < \infty, then bn−1∑k=1∞Xk→ a.s. 0b_{n}^{-1} \sum_{k = 1}^{\infty } X_{k} \xrightarrow {\text{ a.s. }} 0 as n→∞n \rightarrow \infty.

?
Problem 7.11.31

The Markov chain X0,X1,…,XnX_{0}, X_{1}, \ldots , X_{n} has initial distribution fi=P(X0=i)f_{i} = \mathbb {P}\left(X_{0} = i\right) and transition matrix P\mathbf{P}. The log-likelihood function λ(P)\lambda (\mathbf{P}) is defined as λ(P)=log⁡(fX0pX0,X1pX1,X2⋯pXn−1,Xn)\lambda (\mathbf{P}) = \log \left(f_{X_{0}} p_{X_{0}, X_{1}} p_{X_{1}, X_{2}} \cdots p_{X_{n-1}, X_{n}}\right). Show that:

?
(a)

λ(P)=log⁡fX0+∑i,jNijlog⁡pij\lambda (\mathbf{P}) = \log f_{X_{0}}+\sum_{i, j} N_{i j} \log p_{i j} where NijN_{i j} is the number of transitions from ii to jj,

(b)

viewed as a function of the pij,λ(P)p_{i j}, \lambda (\mathbf{P}) is maximal when pij=p^ijp_{i j} = \widehat{p}_{i j} where p^ij=Nij/∑kNik\widehat{p}_{i j} = N_{i j} / \sum_{k} N_{i k},

(c)

if XX is irreducible and ergodic then p^ij→ a.s. pij\widehat{p}_{i j} \xrightarrow {\text{ a.s. }} p_{i j} as n→∞n \rightarrow \infty.

Problem 7.11.32

Ergodic theorem in discrete time. Let XX be an irreducible discrete-time Markov chain, and let μi\mu_{i} be the mean recurrence time of state ii. Let Vi(n)=∑r=0n−1I{Xr=i}V_{i}(n) = \sum_{r = 0}^{n-1} I_{\left\{ X_{r} = i\right\} } be the number of visits to ii up to n−1n-1, and let ff be any bounded function on SS. Show that:

?
(a)

n−1Vi(n)→ a.s. μi−1n^{-1} V_{i}(n) \xrightarrow {\text{ a.s. }} \mu_{i}^{-1} as n→∞n \rightarrow \infty,

(b)

if μi<∞\mu_{i} < \infty for all ii, then

1n∑r=0n−1f(Xr)→∑i∈Sf(i)/μi as n→∞ \frac{1}{n} \sum _{r = 0}^{n-1} f\left(X_{r}\right) \rightarrow \sum _{i \in S} f(i) / \mu _{i} \quad \text{ as } n \rightarrow \infty
Problem 7.11.33

Ergodic theorem in continuous time. Let XX be an irreducible recurrent continuous-time Markov chain with generator G\mathbf{G} and finite mean return times mjm_{j}.

?
(a)

Show that 1t∫0tI{X(s)=j}ds→ a.s. 1mjgj\frac{1}{t} \int_{0}^{t} I_{\left\{ X(s) = j\right\} } d s \xrightarrow {\text{ a.s. }} \frac{1}{m_{j} g_{j}} as t→∞t \rightarrow \infty;

(b)

deduce that the stationary distribution π\pi satisfies πj=1/(mjgj)\pi_{j} = 1 /\left(m_{j} g_{j}\right);

(c)

show that, if ff is a bounded function on SS,

1t∫0tf(X(s))ds→ a.s. ∑iπif(i) as t→∞. \frac{1}{t} \int _{0}^{t} f(X(s)) d s \xrightarrow {\text{ a.s. }} \sum _{i} \pi _{i} f(i) \quad \text{ as } t \rightarrow \infty .
Problem 7.11.34

Suppose that the sequences {Xn:n≥1}\left\{ X_{n}: n \geq 1\right\} and {Yn:n≥1}\left\{ Y_{n}: n \geq 1\right\} are tail equivalent, which is to say that ∑n=1∞P(Xn≠Yn)<∞\sum_{n = 1}^{\infty } \mathbb {P}\left(X_{n} \neq Y_{n}\right) < \infty. Show that:

?
(a)

∑n=1∞Xn\sum_{n = 1}^{\infty } X_{n} and ∑n=1∞Yn\sum_{n = 1}^{\infty } Y_{n} converge or diverge together,

(b)

∑n=1∞(Xn−Yn)\sum_{n = 1}^{\infty }\left(X_{n}-Y_{n}\right) converges almost surely,

(c)

if there exist a random variable XX and a sequence ana_{n} such that an↑∞a_{n} \uparrow \infty and an−1∑r=1nXr→ a.s. Xa_{n}^{-1} \sum_{r = 1}^{n} X_{r} \xrightarrow {\text{ a.s. }} X, then

1an∑r=1nYr→ a.s. X. \frac{1}{a_{n}} \sum _{r = 1}^{n} Y_{r} \xrightarrow {\text{ a.s. }} X.
Problem 7.11.35

Let {Xn:n≥1}\left\{ X_{n}: n \geq 1\right\} be independent random variables. Show that ∑n=1∞Xn\sum_{n = 1}^{\infty } X_{n} converges a.s. if, for some a>0a > 0, the following three series all converge:

(a) ∑nP(∣Xn∣>a)\sum_{n} \mathbb {P}\left(\left|X_{n}\right| > a\right)

(b) ∑nVar⁡[XnI{∣Xn∣≤a}]\sum_{n} \operatorname {Var}\left[X_{n} I_{\left\{ \left|X_{n}\right| \leq a\right\} }\right]

(c) ∑nE[XnI{∣Xn∣≤a}]\sum_{n} \mathbb {E}\left[X_{n} I_{\left\{ \left|X_{n}\right| \leq a\right\} }\right].

?
Remark.
?

The converse holds also, but is harder to prove.

Problem 7.11.36

Let {Xn:n≥1}\left\{ X_{n}: n \geq 1\right\} be independent random variables with continuous common distribution function FF. We call XkX_{k} a record value for the sequence if Xk>XrX_{k} > X_{r} for 1≤r<k1 \leq r < k, and we write IkI_{k} for the indicator function of the event that XkX_{k} is a record value.

?
(a)

Show that the random variables IkI_{k} are independent.

(b)

Show that Rm=∑k=1mIrR_{m} = \sum_{k = 1}^{m} I_{r} satisfies Rm/log⁡m→ a.s. 1R_{m} / \log m \xrightarrow {\text{ a.s. }} 1 as m→∞m \rightarrow \infty.

Problem 7.11.37

Let {Xn:n≥1}\left\{ X_{n}: n \geq 1\right\} be a sequence of independent random variables with P(Xn=1)=P(Xn=−1)=12\mathbb {P}\left(X_{n} = 1\right) = \mathbb {P}\left(X_{n} = -1\right) = \frac{1}{2}. Does the series ∑r=1nXr/r\sum_{r = 1}^{n} X_{r} / r converge a.s. as n→∞n \rightarrow \infty?

?
Problem 7.11.38

Stirling's formula for the gamma function. Let XX have the gamma distribution Γ(1,s)\Gamma (1, s). By considering the integral of the density function of Y=(X−s)/sY = (X-s) / \sqrt{s}, show that Γ(s)∼2πss−12e−s\Gamma (s) \sim \sqrt{2 \pi } s^{s-\frac{1}{2}} e^{-s} as s→∞s \rightarrow \infty. [Hint: You may find it useful that

∫abe−u(x)dx≤1u′(a)∫abu′(x)e−u(x)dx \int _{a}^{b} e^{-u(x)} d x \leq \frac{1}{u^{\prime }(a)} \int _{a}^{b} u^{\prime }(x) e^{-u(x)} d x

if u′(x)u^{\prime }(x) is strictly positive and increasing.]

?
Problem 7.11.39

Let c1,c2,…c_{1}, c_{2}, \ldots be reals, let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables with the mass function f(1)=f(−1)=12f(1) = f(-1) = \frac{1}{2}, and let Sn=∑r=1ncrXrS_{n} = \sum_{r = 1}^{n} c_{r} X_{r}. Write

Bn=∑r=1ncr4,Dn=∑r=1ncr2 B_{n} = \sum _{r = 1}^{n} c_{r}^{4}, \quad D_{n} = \sqrt{\sum _{r = 1}^{n} c_{r}^{2}}
?
(a)

Use characteristic functions to show that Sn/DnS_{n} / D_{n} converges in distribution to the N(0,1)N(0,1) distribution (as n→∞n \rightarrow \infty) if and only if Bn/Dn4→0B_{n} / D_{n}^{4} \rightarrow 0. [Hint: You may use the fact that −23θ4≤12θ2+log⁡cos⁡θ≤−112θ4-\frac{2}{3} \theta^{4} \leq \frac{1}{2} \theta^{2}+\log \cos \theta \leq -\frac{1}{12} \theta^{4} for −14π≤θ≤14π-\frac{1}{4} \pi \leq \theta \leq \frac{1}{4} \pi.]

(b)

Find the limit of Sn/DnS_{n} / D_{n} in the special case cr=2−rc_{r} = 2^{-r}.

Problem 7.11.40

Let XX and YY be random variables with mean 00, variance 11, and correlation ρ\rho. Show that, for ϵ>0\epsilon > 0,

P(∣X∣∨∣Y∣>ϵ)≤1ϵ2(1+1−ρ2) \mathbb {P}\left(\left|X\right| \vee \left|Y\right| > \epsilon \right) \leq \frac{1}{\epsilon ^{2}}\left(1+\sqrt{1-\rho ^{2}}\right)

where x∨y=max⁡{x,y}x \vee y = \max \left\{ x, y\right\}. [Hint: If ∣t∣≤1\left|t\right| \leq 1, the function g(x,y)=(x2−2txy+y2)/(ϵ2(1−t2))g(x, y) = \left(x^{2}-2 t x y+y^{2}\right) /\left(\epsilon^{2}\left(1-t^{2}\right)\right) is non-negative, and moreover satisfies g(x,y)≥1g(x, y) \geq 1 when ∣x∣∨∣y∣≥ϵ\left|x\right| \vee \left|y\right| \geq \epsilon.]

?
Problem 7.11.41

Poisson tail, balls in bins. Let XX have the Poisson distribution with parameter 1.

?
(a)

Show that P(X≥t)≤et−1/tt\mathbb {P}\left(X \geq t\right) \leq e^{t-1} / t^{t} for t≥1t \geq 1.

(b)

Deduce that the maximum MnM_{n} of nn independent random variables, distributed as XX, satisfies

lim⁡n→∞P(Mn≥(1+a)log⁡nlog⁡log⁡n)={1 if a<00 if a>0 \lim _{n \rightarrow \infty } \mathbb {P}\left(M_{n} \geq \frac{(1+a) \log n}{\log \log n}\right) = \begin{cases} 1 & \text{ if } a < 0 \\ 0 & \text{ if } a > 0\end{cases}