Chapter 7: Problem 6
Let \(S\) and \(T\) be stopping times.
(i) \(\\{S
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Problem 6
Let \(S\) and \(T\) be stopping times.
(i) \(\\{S
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(S\) be a stopping time and let \(S_{n}=\left(\left[2^{n} S\right]+1\right) / 2^{n}\) where \([x]=\) the largest integer \(\leq x\). That is, $$ S_{n}=(m+1) 2^{-n} \text { if } m 2^{-n} \leq S<(m+1) 2^{-n} $$
Let \(\sigma=\inf \left\\{t: B_{t} \notin(a, b)\right\\}\) and let, \(\lambda>0
.\) Use the strong Markov property to show
$$
E_{x} \exp \left(-\lambda T_{a}\right)=E_{x}\left(e^{-\lambda \sigma} ;
T_{a}
When \(k=1\), the last result says that if \(X_{1}, X_{2}, \ldots\) are i.i.d. with \(E X_{i}=0\) and \(E X_{i}^{2}=1\), then $$ n^{-3 / 2} \sum_{m=1}^{n}(n+1-m) X_{m} \Rightarrow \int_{0}^{1} B_{t} d t $$ (i) Show that the right-hand side has a normal distribution with mean 0 and variance 1/3. (ii) Deduce this result from the Lindeberg-Feller theorem.
Show that if \(E\left|X_{i}\right|^{\alpha}=\infty\) for some \(\alpha<2\) then $$ \underset{n \rightarrow \infty}{\limsup }\left|X_{n}\right| / n^{1 / \alpha}=\infty \quad \text { a.s. } $$
Suppose \(S_{n}\) is one-dimensional simple random walk and let $$ R_{n}=1+\max _{m \leq n} S_{m}-\min _{m \leq n} S_{m} $$ be the number of points visited by time \(n\). Show that \(R_{n} / \sqrt{n} \Rightarrow a\) limit.
What do you think about this solution?
We value your feedback to improve our textbook solutions.