exercise:Ef5bcf05aa: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Given a random walk <math>W</math> of length <math>m</math>, with summands <math display="block"> \{X_1, X_2, \ldots,X_m\}\ , </math> define the ''reversed'' random walk to be the walk <math>W^*</math> with summands <math display="block"> \{...") |
No edit summary |
||
| Line 12: | Line 12: | ||
<math display="block"> \{X_m, X_{m-1}, \ldots, X_1\}\ . </math> | <math display="block"> \{X_m, X_{m-1}, \ldots, X_1\}\ . </math> | ||
<ul><li> Show that the <math>k</math>th partial sum <math>S^*_k</math> satisfies the equation | <ul style="list-style-type:lower-alpha"><li> Show that the <math>k</math>th partial sum <math>S^*_k</math> satisfies the equation | ||
<math display="block"> | <math display="block"> | ||
| Line 23: | Line 23: | ||
vertical line.) | vertical line.) | ||
</li> | </li> | ||
<li> Use parts (a) and (b) to prove [[guide:A6f1984402#thm 12.3.2 |Theorem | <li> Use parts (a) and (b) to prove [[guide:A6f1984402#thm 12.3.2 |Theorem]]. | ||
</li> | </li> | ||
</ul> | </ul> | ||
Latest revision as of 02:08, 15 June 2024
[math]
\newcommand{\NA}{{\rm NA}}
\newcommand{\mat}[1]{{\bf#1}}
\newcommand{\exref}[1]{\ref{##1}}
\newcommand{\secstoprocess}{\all}
\newcommand{\NA}{{\rm NA}}
\newcommand{\mathds}{\mathbb}[/math]
Given a random walk [math]W[/math] of length [math]m[/math], with summands
[[math]] \{X_1, X_2, \ldots,X_m\}\ , [[/math]]
define the reversed random walk to be the walk [math]W^*[/math] with summands
[[math]] \{X_m, X_{m-1}, \ldots, X_1\}\ . [[/math]]
- Show that the [math]k[/math]th partial sum [math]S^*_k[/math] satisfies the equation
[[math]] S^*_k = S_m - S_{n-k}\ , [[/math]]where [math]S_k[/math] is the [math]k[/math]th partial sum for the random walk [math]W[/math].
- Explain the geometric relationship between the graphs of a random walk and its reversal. (It is not in general true that one graph is obtained from the other by reflecting in a vertical line.)
- Use parts (a) and (b) to prove Theorem.