Coupling argument

[19/68%]
Show
LaTeX

Let f,g:R→Rf, g: \mathbb {R} \rightarrow \mathbb {R} be monotone nondecreasing. Show that for any random variable XX

E[f(X)g(X)]≥E[f(X)]E[g(X)] \mathbb {E}\left[f(X) g(X)\right] \geq \mathbb {E}\left[f(X)\right] \mathbb {E}\left[g(X)\right]

provided all the expectations exist.

?

Let mm be the renewal function of an ordinary renewal process NN whose interarrival times have finite mean.

?
(a)

Show that the mean number of renewals in the interval (a,b](a, b] is no larger than 1+m(b−a)1+m(b-a).

(b)

Show that there exists A>0A > 0 such that m(t)≤A(1+t)m(t) \leq A(1+t) for t≥0t \geq 0.

(c)

Suppose the interarrival times XrX_{r} are non-arithmetic with finite variance and mean μ\mu. Show that

m(t)−tμ→σ2−μ22μ2 as t→∞ m(t)-\frac{t}{\mu } \rightarrow \frac{\sigma ^{2}-\mu ^{2}}{2 \mu ^{2}} \quad \text{ as } t \rightarrow \infty

[Hint: Use coupling and Blackwell's renewal theorem (10.2.5).]

Let β,γ∈[0,1]\beta , \gamma \in [0,1]. Bertha and Harold play a game of rackets. Bertha wins the point with probability β\beta when she serves, and Harold wins with probability γ\gamma when he serves. The first player to win nn points wins the game, and Bertha serves first. Consider the following rules for changing server.

?
(a)

Service alternates between players.

(b)

Service is retained until a point is lost, and then passes to the other player.

(c)

Service is retained until a point is won, and then passes to the other player.

(d)

Bertha serves the first nn points, and then Harold serves any further points required to decide the outcome.

Show that P(Bertha wins)\mathbb {P}\left(\text{Bertha wins}\right) is the same for all four rules.

Show that XX is stochastically larger than YY if and only if E[u(X)]≥E[u(Y)]\mathbb {E}\left[u(X)\right] \geq \mathbb {E}\left[u(Y)\right] for any nondecreasing function uu for which the expectations exist.

?

Let XX and YY be Poisson distributed with respective parameters λ\lambda and μ\mu. Show that XX is stochastically larger than YY if λ≥μ\lambda \geq \mu.

?

Show for discrete random variables X,YX, Y that P(X=Y)≤1−12dTV(X,Y)\mathbb {P}\left(X = Y\right) \leq 1-\frac{1}{2} d_{\mathrm{TV}}(X, Y), where dTVd_{\mathrm{TV}} denotes total variation distance.

?

Show that equality is possible in the inequality of Exercise (4.12.4) in the following sense. For any pair X,YX, Y of discrete random variables, there exists a pair X′X^{\prime }, Y′Y^{\prime } having the same marginal distributions as X,YX, Y such that P(X′=Y′)=1−12dTV(X,Y)\mathbb {P}\left(X^{\prime } = Y^{\prime }\right) = 1-\frac{1}{2} d_{\mathrm{TV}}(X, Y).

?

Let XX and YY be indicator variables with E[X]=p,E[Y]=q\mathbb {E}\left[X\right]= p, \mathbb {E}\left[Y\right] = q. What is the maximum possible value of P(X=Y)\mathbb {P}\left(X = Y\right), as a function of p,qp, q? Explain how X,YX, Y need to be distributed in order that P(X=Y)\mathbb {P}\left(X = Y\right) be:

?
(a)

maximized,

(b)

minimized.

Let π\mathbf{\pi } be a positive mass function on the finite set Θ\Theta, and let P\mathbf{P} be the transition matrix of an irreducible, aperiodic Markov chain with stationary distribution π\mathbf{\pi }. Let W=(W(i):i∈Θ)W = (W(i): i \in \Theta ) be a vector of random variables such that P(W(i)=j)=pij\mathbb {P}\left(W(i) = j\right) = p_{i j} for i,j∈Θi, j \in \Theta, and use WW as an update rule in the coupling-from-the-past algorithm for sampling from π\pi.

?
(a)

If the W(i),i∈ΘW(i), i \in \Theta, are independent, show that the coalescence time is a.s. finite.

(b)

Give two examples of situations in which the coalescence time is a.s. infinite.

?
(a)

Show that for each pair i,ji, j of states of an irreducible aperiodic chain, there exists N=N(i,j)N = N(i, j) such that pij(n)>0p_{i j}(n) > 0 for all n≥Nn \geq N.

(b)

Let XX and YY be independent irreducible aperiodic chains with the same state space SS and transition matrix P\mathbf{P}. Show that the bivariate chain Zn=(Xn,Yn),n≥0Z_{n} = \left(X_{n}, Y_{n}\right), n \geq 0, is irreducible and aperiodic.

(c)

Show that the bivariate chain ZZ may be reducible if XX and YY are periodic.

Let XX and YY be independent recurrent birth-death processes with the same parameters (and no explosions). It is not assumed that X0=Y0X_{0} = Y_{0}. Show that:

?
(a)

for any A⊆R,∣P(Xt∈A)−P(Yt∈A)∣→0A \subseteq \mathbb {R},\left|\mathbb {P}\left(X_{t} \in A\right)-\mathbb {P}\left(Y_{t} \in A\right)\right| \rightarrow 0 as t→∞t \rightarrow \infty,

(b)

if P(X0≤Y0)=1\mathbb {P}\left(X_{0} \leq Y_{0}\right) = 1, then E[g(Xt)]≤E[g(Yt)]\mathbb {E}\left[g\left(X_{t}\right)\right] \leq \mathbb {E}\left[g\left(Y_{t}\right)\right] for any increasing function gg.

For nonnegative random variables Z1,⋯ ,ZmZ_{1}, \cdots , Z_{m}, show that E[Z1Z2⋯Zm]\mathbb {E}\left[Z_{1} Z_{2} \cdots Z_{m}\right] is no greater than ∫01QZ1(u)QZ2(u)⋯QZm(u)du\int_{0}^{1} Q_{Z_{1}}(u) Q_{Z_{2}}(u) \cdots Q_{Z_{m}}(u) d u, with QZiQ_{Z_{i}} the quantile function for ZiZ_{i}.

?

In the notation of Example ⟨32⟩\langle 32 \rangle, show that E[Ψ(∣X−Y∣)]≥P~(Ψ(∣X~−Y~∣))\mathbb {E}\left[\Psi (\left|X-Y\right|)\right] \geq \widetilde{\mathbb {P}}\left(\Psi (\left|\tilde{X}-\tilde{Y}\right|)\right), for every convex, increasing function Ψ\Psi on R+\mathbb {R}^{+}.

Example 32: For a random variable XX with distribution function FX(x):=P(X≤x)F_{X}(x): = \mathbb {P}\left(X \leq x\right), define its quantile function qX(u):=inf⁡{t:FX(t)≥u}q_{X}(u): = \inf \left\{ t : F_{X}(t) \geq u\right\} for 0<u<10 < u < 1. Regarded as a random variable on (0,1)(0,1), equipped with its Borel sigma-field and Lebesgue measure P~\widetilde{\mathbb {P}}, the function X~:=qX(u)\tilde{X}: = q_{X}(u) has the same distribution as XX. Similarly, if YY has distribution function FYF_{Y} and quantile function qYq_{Y}, the random variable Y~:=qY(u)\tilde{Y}: = q_{Y}(u) has the same distribution as YY. Both X~\tilde{X} and Y~\tilde{Y} are defined on the same (0,1)(0,1), even though XX and YY need not be defined on the same space, giving a coupling of XX and YY.

?

Let PP and QQ be two probability measures defined on the same sigma-field A\mathcal{A} of a set XX. The total variation distance v=v(P,Q)v = v(P, Q) is defined as sup⁡A∈A∣PA−QA∣\sup_{A \in \mathcal{A}}\left|P A-Q A\right|.

?
(i)

Suppose XX are YY are random elements of XX, defined on the same probability space (Ω,F,P)(\Omega , \mathcal{F}, \mathbb {P}), with distributions PP and QQ. Show that P∗{X≠Y}≥v(P,Q)\mathbb {P}^{*}\left\{ X \neq Y\right\} \geq v(P, Q). Hint: Choose a measurable set D⊇{X≠Y}D \supseteq \left\{ X \neq Y\right\} with P(D)=P∗{X≠Y}\mathbb {P}\left(D\right) = \mathbb {P}^{*}\left\{ X \neq Y\right\}. Note that P(X∈A)−P(Y∈A)=P(X∈A)∩D−P(Y∈A)∩D\mathbb {P}\left(X \in A\right)-\mathbb {P}\left(Y \in A\right) = \mathbb {P}\left(X \in A\right) \cap D-\mathbb {P}\left(Y \in A\right) \cap D.

(ii)

Suppose the diagonal Δ:={(x,y)∈X×X:x=y}\Delta : = \left\{ (x, y) \in \mathcal{X} \times \mathcal{X}: x = y\right\} is product measurable. Recall from Section 3.3 that v=1−(P∧Q)(X)=(P−Q)+(X)=(Q−P)+(X)v = 1-(P \wedge Q)(X) = (P-Q)^{+}(X) = (Q-P)^{+}(X). Define a probability measure P=1v(P−Q)+⊗(Q−P)++λ\mathbb {P} = \frac{1}{v}(P-Q)^{+} \otimes (Q-P)^{+}+\lambda, where λ\lambda is the image of P∧QP \wedge Q under the map x↦(x,x)x \mapsto (x, x). Let XX and YY be the coordinate maps. Show that XX has distribution PP and YY has distribution QQ, and P(X≠Y)=v\mathbb {P}\left(X \neq Y\right) = v.

Prove Lemma ⟨9⟩\langle 9 \rangle by carrying out on the following steps. Write RAR_{A} for ∪α∈ARα\cup_{\alpha \in A} R_{\alpha }. Argue by induction on the size of SS.

Lemma 9: Let ν\nu be a finite measure on a finite set SS and μ\mu be a finite measure on a sigma-field B\mathcal{B} on a set TT. Suppose {Rα:α∈S}\left\{ R_{\alpha }: \alpha \in S\right\} is a collection of measurable sets with the domination property that ν(A)≤μ(∪α∈ARα)\nu (A) \leq \mu \left(\cup_{\alpha \in A} R_{\alpha }\right) for all A⊆SA \subseteq S. Then there exists a probability kernel KK from SS to TT with KαK_{\alpha } concentrated on RαR_{\alpha } for each α\alpha and ∑α∈Sν{α}Kα≤μ\sum_{\alpha \in S} \nu \left\{ \alpha \right\} K_{\alpha } \leq \mu. With no loss of generality, suppose S={1,2,…,m}S = \left\{ 1,2, \ldots , m\right\}. Check the case m=1m = 1. Work from the inductive hypothesis that the result is true for S <m< m.

?
(i)

Suppose there exists a proper subset A0A_{0} of SS for which νA0=μRA0\nu A_{0} = \mu R_{A_{0}}. Define Rα′=Rα\RA0R_{\alpha }^{\prime } = R_{\alpha } \backslash R_{A_{0}} for α∉A0\alpha \notin A_{0}. Show that νA≤μRA′\nu A \leq \mu R_{A}^{\prime } for all A⊆S\A0A \subseteq S \backslash A_{0}. Construct KK by invoking the inductive hypothesis separately for A0A_{0} and S\A0S \backslash A_{0}. (Compare with part (iv) of Problem [5].) Now suppose νA<μRA\nu A < \mu R_{A} for all proper subsets AA of SS. Write LαL_{\alpha } for the probability distribution μ(⋅∣Rα)\mu \left(\cdot \mid R_{\alpha }\right), which concentrates on RαR_{\alpha }.

(ii)

Show that μ≥ν{1}L1\mu \geq \nu \left\{ 1\right\} L_{1}. Hint: Show μB≥ν{1}μ(BR1)/μR1\mu B \geq \nu \left\{ 1\right\} \mu \left(B R_{1}\right) / \mu R_{1} for all B⊆R1B \subseteq R_{1}.

Write ϵ1\epsilon_{1} for the unit mass at 1. Let θ0\theta_{0} be the largest value in [0,ν{1}][0, \nu \left\{ 1\right\} ] for which (μ−θ0L1)RA≥(ν−θ0ϵ1)A\left(\mu -\theta_{0} L_{1}\right) R_{A} \geq \left(\nu -\theta_{0} \epsilon_{1}\right) A for every A⊆SA \subseteq S.

(iii)

If θ0=ν{1}\theta_{0} = \nu \left\{ 1\right\}, use the inductive hypothesis to find a probability kernel from S\{1}S \backslash \left\{ 1\right\} into TT for which (μ−ν{1}L1)≥∑α≥2ν{α}Kα\left(\mu -\nu \left\{ 1\right\} L_{1}\right) \geq \sum_{\alpha \geq 2} \nu \left\{ \alpha \right\} K_{\alpha }. Define K1=L1K_{1} = L_{1}.

(iv)

If θ0<ν(1)\theta_{0} < \nu (1), show that there exists an A0⊆SA_{0} \subseteq S for which (μ−θL1)RA0<(ν−θϵ1)A0\left(\mu -\theta L_{1}\right) R_{A_{0}} < \left(\nu -\theta \epsilon_{1}\right) A_{0} when ν{1}≥θ>θ0\nu \left\{ 1\right\} \geq \theta > \theta_{0}. Deduce that A0A_{0} must be a proper subset of SS for which (μ−θ0L1)RA0=(ν−θ0ϵ1)A0\left(\mu -\theta_{0} L_{1}\right) R_{A_{0}} = \left(\nu -\theta_{0} \epsilon_{1}\right) A_{0}. Invoke part (i) to find a probability kernel MM for which μ−θ0L1≥(ν{1}−θ0)M1+∑α≥2ν{α}Mα\mu -\theta_{0} L_{1} \geq \left(\nu \left\{ 1\right\} -\theta_{0}\right) M_{1}+\sum_{\alpha \geq 2} \nu \left\{ \alpha \right\} M_{\alpha }. Define K1:=(θ0/v{1})L1+(1−θ0/v{1})M1K_{1}: = \left(\theta_{0} / v\left\{ 1\right\} \right) L_{1}+\left(1-\theta_{0} / v\left\{ 1\right\} \right) M_{1}.

(Continuation) Let F(x)F(x) and G(x)G(x) be two distribution functions, with F(x)<G(x)F(x) < G(x) for all xx. Prove that there exists a probability space and two random variables ξ\xi and η\eta, defined on this probability space, such that F(x)=P(ξ⩽x),G(x)=P(η⩽x)F(x) = \mathbb {P}\left(\xi \leqslant x\right), G(x) = \mathbb {P}\left(\eta \leqslant x\right) and ξ>η\xi > \eta.

?

Let ξ\xi and η\eta be random variables with distribution functions F(x)F(x) and G(x)G(x) respectively. Prove that

sup⁡x∣F(x)−G(x)∣⩽P(ξ≠η). \sup _{x}\left|F(x)-G(x)\right| \leqslant \mathbb {P}\left(\xi \neq \eta \right) .
?

Let ξ\xi and η\eta be random variables with distribution functions F(x)F(x) and G(x)G(x) respectively. Prove that if

P(∣ξ−η∣⩾ε)⩽ε \mathbb {P}\left(\left|\xi -\eta \right| \geqslant \varepsilon \right) \leqslant \varepsilon

for some positive ε>0\varepsilon > 0, then

L(F,G)⩽ε. L(F, G) \leqslant \varepsilon .
?

Let ξ\xi and η\eta be random variables with probability distributions F\mathbf{F} and G\mathbf{G} respectively. Prove that

Var⁡(F,G)⩽P(ξ≠η). \operatorname {Var}(\mathbf{F}, \mathbf{G}) \leqslant \mathbb {P}\left(\xi \neq \eta \right) .
?

References

[AtLa06] Athreya K.B., Lahiri S.N. Measure Theory and Probability Theory. Springer, 2006.
[GrSt20] Grimmett G.R., Stirzaker D.R. Probability and Random Processes. 4th ed., Oxford University Press, 2020.
[Pol02] Pollard D. A User's Guide to Measure Theoretic Probability. Cambridge University Press, 2002.
[ПУУ86] Прохоров А.В., Ушаков В.Г., Ушаков Н. Задачи по теории вероятностей. Наука. Главная редакция физико-математической литературы, 1986.