In 1827, the botanist Robert Brown noticed that tiny particles from pollen, when suspended in water, exhibited continuous but very jittery and erratic motion. In his miracle year
in 1905, Albert Einstein explained the behavior physically, showing that the particles were constantly being bombarded by the molecules of the water, and thus helping to firmly establish the atomic theory of matter. Brownian motion as a mathematical random process was first constructed in rigorous way by Norbert Wiener in a series of papers starting in 1918. For this reason, the Brownian motion process is also known as the Wiener process.
Run the simulation below to get an idea of what Mr. Brown may have observed under his microscope.
Along with the Bernoulli trials process and the Poisson process, the Brownian motion process is of central importance in probability. Each of these processes is based on a set of idealized assumptions that lead to a rich mathematial theory. In each case also, the process is used as a building block for a number of related random processes that are of great importance in a variety of applications. In particular, Brownian motion and related processes are used in applications ranging from physics to statistics to economics.
A standard Brownian motion is a random process \( \bs{X} = \{X_t: t \in [0, \infty)\} \) with state space \( \R \) that satisfies the following properties:
To understand the assumptions physically, let's take them one at a time.
Of course, the first question we should ask is whether there exists a stochastic process satisfying definition . Fortunately, the answer is yes, although the proof is complicated.
There exists a probability space \( (\Omega, \mathscr{F}, \P) \) and a stochastic process \( \bs{X} = \{X_t: t \in [0, \infty)\} \) on this probability space satisfying the assumptions in definition .
The assumptions in definition lead to a consistent set of finite dimensional distributions (which are given in ). Thus by Kolmogorov existence theorem, there exists a stochastic process \( \bs{U} = \{U_t: t \in [0, \infty)\} \) that has these finite dimensional distributions. However, \( \bs{U} \) does not have continuous sample paths, but we can construct from \( \bs{U} \) an equivalent process that does have continuous sample paths.
First recall that a binary rational (or dyadic rational) in \( [0, \infty) \) is a number of the form \( k / 2^n \) where \( k, \, n \in \N \). Let \( \D_+ \) denote the set of all binary rationals in \( [0, \infty) \), and recall that \( \D_+ \) is countable but also dense in \( [0, \infty) \) (that is, if \( t \in [0, \infty) \setminus \D_+ \) then there exists \( t_n \in \D_+ \) for \( n \in \N_+ \) such that \( t_n \to t \) as \( n \to \infty \)).
Now, for \( n \in \N_+ \), let \( X_n(t) = U_t \) if \( t \) is a binary rational of the form \( k \big/ 2^n \) for some \( k \in \N \). If \( t \) is not such a binary rational, define \( X_n(t) \) by linear interpolation between the the closest binary rationals of this form on either side of \( t \). Then \( X_n(t) \to U(t) \) as \( n \to \infty \) for every \( t \in \D_+\), and with probability 1, the convergence is uniform on \( \D_+ \cap [0, T] \) for each \( T \gt 0 \). It then follows that \( \bs{U} \) is continuous on \( \D_+ \) with probability 1.
For the last step, let \( X_t = \lim_{s \to t, \; s \in \D_+} U_s \) for \( t \in [0, \infty) \). The limit exists since \( \bs{U} \) is continuous on \( \D_+ \) with probability 1. The process \( \bs{X} = \{X_t: t \in [0, \infty)\} \) is continuous on \( [0, \infty) \) with probability 1, and has the same finite dimensional distributions as \( \bs{U} \).
Run the simulation of the standard Brownian motion process a few times in single-step mode. Note the qualitative behavior of the sample paths. Run the simulation 1000 times and compare the empirical density function and moments of \( X_t \) to the true probabiltiy density function and moments.
Clearly the underlying dynamics of the Brownian particle being knocked about by molecules suggests a random walk as a possible model, but with tiny time steps and tiny spatial jumps. Let \( \bs{X} = (X_0, X_1, X_2, \ldots) \) be the symmetric simple random walk. Thus, \( X_n = \sum_{i=1}^n U_i \) where \( \bs{U} = (U_1, U_2, \ldots) \) is a sequence of independent variables with \( \P(U_i = 1) = \P(U_i = -1) = \frac{1}{2} \) for each \( i \in \N_+ \). Recall that \( \E(X_n) = 0 \) and \( \var(X_n) = n \) for \( n \in \N \). Also, since \( \bs{X} \) is the partial sum process associated with an IID sequence, \( \bs{X} \) has stationary, independent increments (but of course in discrete time). Finally, recall that by the central limit theorem, \( X_n \big/ \sqrt{n} \) converges to the standard normal distribution as \( n \to \infty \). Now, for \( h, d \in (0, \infty) \) the continuous time process \[ \bs{X}_{h, d} = \left\{d X_{\lfloor t / h \rfloor}: t \in [0, \infty) \right\} \] is a jump process with jumps at \( \{0, h, 2 h, \ldots\} \) and with jumps of size \( \pm d \). Basically we would like to let \( h \downarrow 0 \) and \( d \downarrow 0 \), but this cannot be done arbitrarily. Note that \( \E\left[X_{h, d}(t)\right] = 0 \) but \( \var\left[X_{h,d}(t)\right] = d^2 \lfloor t / h \rfloor \). Thus, by the central limit theorem, if we take \( d = \sqrt{h} \) then the distribution of \( X_{h, d}(t) \) will converge to the normal distribution with mean 0 and variance \( t \) as \( h \downarrow 0 \). More generally, we might hope that all of requirements in the definition in are satisfied by the limiting process, and if so, we have a standard Brownian motion.
Run the simulation of the random walk process for increasing values of \( n \). In particular, run the simulation several times with \( n = 100 \). Compare the qualitative behavior with the standard Brownian motion process. Note that the scaling of the random walk in time and space is effecitvely accomplished by scaling the horizontal and vertical axes in the graph window.
Let \( \bs{X} = \{X_t: t \in [0, \infty)\} \) be a standard Brownian motion. It follows from part (d) of definition that \( X_t \) has probability density function \( f_t \) given by \[ f_t(x) = \frac{1}{\sqrt{2 \pi t}} \exp\left(-\frac{x^2}{2 t}\right), \quad x \in \R \] This family of density functions determines the finite dimensional distributions of \( \bs{X} \).
If \( t_1, t_2, \ldots, t_n \in (0, \infty) \) with \( 0 \lt t_1 \lt t_2 \cdots \lt t_n \) then \( (X_{t_1}, X_{t_2}, \ldots, X_{t_n}) \) has probability density function \( f_{t_1, t_2, \ldots, t_n} \) given by \[ f_{t_1, t_2, \ldots, t_n}(x_1, x_2, \ldots, x_n) = f_{t_1}(x_1) f_{t_2 - t_1}(x_2 - x_1) \cdots f_{t_n - t_{n-1}}(x_n - x_{n-1}), \quad (x_1, x_2, \ldots, x_n) \in \R^n \]
This follows because \(\bs{X}\) has stationary, independent increments.
\( \bs{X} \) is a Gaussian process with mean function mean function \( m(t) = 0 \) for \( t \in [0, \infty) \) and covariance function \( c(s, t) = \min\{s, t\} \) for \( s, t \in [0, \infty) \).
The fact that \(\bs{X}\) is a Gaussian process follows because \(X_t\) is normally distributed for each \(t \in T\) and \(\bs{X}\) has stationary, independent increments. The mean function is 0 by assumption. For the covariance function, suppose \( s, \, t \in [0, \infty) \) with \( s \le t \). Since \( X_s \) and \( X_t - X_s \) are independent, we have \[ \cov(X_s, X_t) = \cov\left[X_s, X_s + (X_t - X_s)\right] = \var(X_s) + 0 = s \]
Recall that for a Gaussian process, the finite dimensional (multivariate normal) distributions are completely determined by the mean function \( m \) and the covariance function \( c \). Thus, it follows that a standard Brownian motion is characterized as a continuous Gaussian process with the mean and covariance functions in the last theorem. Note also that \[ \cor(X_s, X_t) = \frac{\min\{s, t\}}{\sqrt{s t}} = \sqrt{\frac{\min\{s, t\}}{\5\{s, t\}}} ,\quad (s, t) \in [0, \infty)^2 \] We can also give the higher moments and the moment generating function for \( X_t \).
For \( n \in \N \) and \( t \in [0, \infty) \),
These moments follow from standard results, since \( X_t \) is normally distributed with mean 0 and variance \( t \).
For \( t \in [0, \infty) \), \( X_t \) has moment generating function given by \[ \E\left(e^{u X_t}\right) = e^{t u / 2}, \quad u \in \R \]
Again, this is a standard result for the normal distribution.
There are several simple transformations that preserve standard Brownian motion and will give us insight into some of its properties. As usual, our starting place is a standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty)\} \). Our first result is that reflecting the paths of \( \bs{X} \) in the line \( x = 0 \) gives another standard Brownian motion
Let \( Y_t = -X_t \) for \( t \ge 0 \). Then \( \bs{Y} = \{Y_t: t \ge 0\} \) is also a standard Brownian motion.
Clearly the new process is still a Gaussian process, with mean function \( \E(-X_t) = -\E(X_t) = 0 \) for \( t \in [0, \infty) \) and covariance function \( \cov(-X_s, -X_t) = \cov(X_s, X_t) = \min\{s, t\} \) for \( (s, t) \in [0, \infty)^2 \). Finally, since \( \bs{X} \) is continuous, so is \( \bs{Y} \).
Our next result is related to the Markov property, which we explore in more detail below. If we restart
Brownian motion at a fixed time \( s \), and shift the origin to \( X_s \), then we have another standard Brownian motion. This means that Brownian motion is both temporally and spatially homogeneous.
Fix \( s \in [0, \infty) \) and define \( Y_t = X_{s + t} - X_s \) for \( t \ge 0 \). Then \( \bs{Y} = \{Y_t: t \in [0, \infty)\} \) is also a standard Brownian motion.
Since \( \bs{X} \) has stationary, independent increments, the process \( \bs{Y} \) is equivalent in distribution to \( \bs{X} \). Clearly also \(\bs{Y} \) is continuous since \( \bs{X} \) is.
Our next result is a simple time reversal, but to state this result, we need to restrict the time parameter to a bounded interval of the form \( [0, T] \) where \( T \gt 0 \). The upper endpoint \( T \) is sometimes referred to as a finite time horizon. Note that \( \{X_t: t \in [0, T]\} \) still satisfies definition , but with the time parameters restricted to \( [0, T] \).
Define \( Y_t = X_{T - t} - X_T \) for \( 0 \le t \le T \). Then \( \bs{Y} = \left\{Y_t: t \in [0, T]\right\} \) is also a standard Brownian motion on \( [0, T] \).
\( \bs{Y} \) is a Gaussian process, since a finite, linear combination of variables from this process reduces to a finite, linear combination of variables from \( \bs{X} \). Next, \( \E(Y_t) = \E(X_{T - t}) - \E(X_T) = 0 \). Next, if \( s, \; t \in [0, T] \) with \( s \le t \) then \begin{align} \cov(Y_s, Y_t) & = \cov(X_{T - s} - X_T, X_{T-t} - X_t) = \cov(X_{T-s}, X_{T-t}) - \cov(X_{T-s}, X_T) - \cov(X_T, X_{T-t}) + \cov(X_T, X_t) \\ & = (T - t) - (T - s) - (T - t) + T = s \end{align} Finally, \( t \mapsto Y_t \) is continuous on \( [0, T] \) with probability 1, since \( t \mapsto X_t \) is continuous on \( [0, T] \) with probability 1.
Our next transformation involves scaling \( \bs{X} \) both temporally and spatially, and is known as self-similarity.
Let \( a \in (0, \infty) \) and define \( Y_t = \frac{1}{a} X_{a ^2 t} \) for \( t \ge 0 \). Then \( \bs{Y} = \{Y_t: t \in [0, \infty)\} \) is also a standard Brownian motion.
Once again, \( \bs{Y} \) is a Gaussian process, since finite, linear combinations of variables in \(\bs{Y}\) reduce to finite, linear combinations of variables in \(\bs{X}\). Next, \( \E(Y_t) = a \E(X_{a^2 t}) = 0 \) for \( t \gt 0 \), and for \( s, \, t \gt 0 \) with \( s \lt t \), \[ \cov(Y_s, Y_t) = \cov\left(\frac{1}{a} X_{a^2 s}, \frac{1}{a} X_{a^2 t}\right) = \frac{1}{a^2} \cov\left(X_{a^2 s}, X_{a^2 t}\right) = \frac{1}{a^2} a^2 s = s \] Finally \( \bs{Y} \) is a continuous process since \( \bs{X} \) is continuous.
Note that the graph of \( \bs{Y} \) can be obtained from the graph of \( \bs{X} \) by scaling the time axis \( t \) by a factor of \( a^2 \) and scaling the spatial axis \( x \) by a factor of \( a \). The fact that the temporal scale factor must be the square of the spatial scale factor is clearly related to Brownian motion as the limit of random walks. Note also that this transformation amounts to zooming in or out
of the graph of \( \bs{X} \) and hence Brownian motion has a self-similar, fractal quality, since the graph is unchanged by this transformation. This also suggests that, although continuous, \( t \mapsto X_t \) is highly irregular. We consider this in the next subsection.
Our final transformation is referred to as time inversion.
Let \( Y_0 = 0 \) and \( Y_t = t X_{1/t} \) for \( t \gt 0 \). Then \( \bs{Y} = \{Y_t: t \in [0, \infty)\} \) is also a standard Brownian motion.
Clearly \( \bs{Y} \) is a Gaussian process, since finite, linear combinations of variables in \(\bs{Y}\) reduce to finite, linear combinations of variables in \(\bs{X}\). Next, \( \E(Y_t) = t \E(X_{1/t}) = 0 \) for \( t \gt 0 \), and for \( s, \, t \gt 0 \) with \( s \lt t \), \[ \cov\left(Y_s, Y_t\right) = \cov\left(s X_{1/s}, t X_{1/t}\right) = s t \, \cov\left(X_{1/s}, X_{1/t}\right) = s t \frac{1}{t} = s \] Since \( t \mapsto X_t \) is continuous on \( [0, \infty) \) with probability 1, \( t \mapsto Y_t \) is continuous on \( (0, \infty) \) with probability 1. Thus, all that remains is to show continuity at \( t = 0 \). Thus we need to show that with probability 1, \( t X_{1/t} \to 0 \) as \( t \downarrow 0 \). or equivalently, \( X_s / s \to 0 \) as \( s \uparrow \infty \). But this last statement holds by the law of the iterated logarithm , given below.
Definition suggest that standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty)\} \) cannot be a smooth, differentiable function. Consider the usual difference quotient at \( t \), \[ \frac{X_{t+h} - X_t}{h} \] By the stationary increments property, if \( h \gt 0 \), the numerator has the same distribution as \( X_h \), while if \( h \lt 0 \), the numerator has the same distribution as \( -X_{-h} \), which in turn has the same distribution as \( X_{-h} \). So, in both cases, the difference quotient has the same distribution as \( X_{\left|h\right|} \big/ h \), and this variable has the normal distribution with mean 0 and variance \( \left|h\right| \big/ h^2 = 1 \big/ \left|h\right| \). So the variance of the difference quotient diverges to \( \infty \) as \( h \to 0\), and hence the difference quotient does not even converge in distribution, the weakest form of convergence.
Theorem also suggests that Brownian motion cannot be differentiable. The intuitive meaning of differentiable at \( t \) is that the function is locally linear at \( t \)—as we zoon in, the graph near \( t \) begins to look like a line (whose slope, of course, is the derivative). But as we zoon in on Brownian motion, (in the sense of the transformation), it always looks the same, and in particular, just as jagged. More formally, if \( \bs{X} \) is differentiable at \( t \), then so is the transformed process \( \bs{Y} \), and the chain rule gives \( Y^\prime(t) = a X^\prime(a^2 t) \). But \( \bs{Y} \) is also a standard Brownian motion for every \( a \gt 0 \), so something is clearly wrong. While not rigorous, these examples are motivation for the following theorem:
With probability 1, \( \bs{X} \) is nowhere differentiable on \( [0, \infty) \).
Run the simulation of the standard Brownian motion process. Note the continuity but very jagged quality of the sample paths. Of course, the simulation cannot really capture Brownian motion with complete fidelity.
The following theorems gives a more precise measure of the irregularity of standard Brownian motion.
Standard Brownian motion \( \bs{X} \) has Hölder exponent \( \frac{1}{2} \). That is, \( \bs{X} \) is Hölder continuous with exponent \( \alpha \) for every \( \alpha \lt \frac{1}{2} \), but is not Hölder continuous with exponent \( \alpha \) for any \( \alpha \gt \frac{1}{2} \).
In particular, \( \bs{X} \) is not Lipschitz continuous, and this shows again that it is not differentiable. The following result states that in terms of Hausdorff dimension, the graph of standard Brownian motion lies midway between a simple curve (dimension 1) and the plane (dimension 2).
The graph of standard Brownian motion has Hausdorff dimension \( \frac{3}{2} \).
Yet another indication of the irregularity of Brownian motion is that it has infinite total variation on any interval of positive length.
Suppose that \( a, \, b \in \R \) with \( a \lt b \). Then the total variation of \( \bs{X} \) on \( [a, b] \) is \( \infty \).
As usual, we start with a standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty)\} \). Recall that a Markov process has the property that the future is independent of the past, given the present state. Because of the stationary, independent increments property, Brownian motion has the property. As a minor note, to view \( \bs{X} \) as a Markov process, we sometimes need to relax Assumption 1 and let \( X_0 \) have an arbitrary value in \( \R \). Let \( \mathscr{F}_t = \sigma\{X_s: 0 \le s \le t\} \), the sigma-algebra generated by the process up to time \( t \in [0, \infty) \). The family of \(\sigma\)-algebras \(\mathfrak{F} = \{\mathscr{F}_t: t \in [0, \infty)\}\) is known as a filtration.
Standard Brownian motion is a time-homogeneous Markov process with transition probability density \( p \) given by \[ p_t(x, y) = f_t(y - x) = \frac{1}{\sqrt{2 \pi t}} \exp\left[-\frac{(y - x)^2}{2 t} \right], \quad t \in (0, \infty); \; x, \, y \in \R \]
The transtion density \( p \) satisfies the following diffusion equations. The first is known as the forward equation and the second as the backward equation. \begin{align} \frac{\partial}{\partial t} p_t(x, y) & = \frac{1}{2} \frac{\partial^2}{ \partial y^2} p_t(x, y) \\ \frac{\partial}{\partial t} p_t(x, y) & = \frac{1}{2} \frac{\partial^2}{ \partial x^2} p_t(x, y) \end{align}
These results follows from standard calculus.
The diffusion equations are so named, because the spatial derivative in the first equation is with respect to \( y \), the state forward at time \( t \), while the spatial derivative in the second equation is with respect to \( x \), the state backward at time 0.
Recall that a random time \( \tau \) taking values in \( [0, \infty] \) is a stopping time with respect to the process \( \bs{X} = \{X_t: t \in [0, \infty)\} \) if \( \{\tau \le t\} \in \mathscr{F}_t \) for every \( t \in [0, \infty) \). Informally, we can determine whether or not \( \tau \le t \) by observing the process up to time \( t \). An important special case is the first time that our Brownian motion hits a specified state. Thus, for \(x \in \R\) let \(\tau_x = \inf\{t \in [0, \infty): X_t = x\}\). The random time \(\tau_x\) is a stopping time.
For a stopping time \( \tau \), we need the \( \sigma \)-algebra of events that can be defined in terms of the process up to the random time \( \tau \), analogous to \( \mathscr{F}_t \), the \( \sigma \)-algebra of events that can be defined in terms of the process up to a fixed time \( t \). The appropriate definition is \[ \mathscr{F}_\tau = \{B \in \mathscr{F}: B \cap \{\tau \le t\} \in \mathscr{F}_t \text{ for all } t \ge 0\} \] See the section on Filtrations and Stopping Times for more information on filtrations, stopping times, and the \(\sigma\)-algebra associated with a stopping time.
The strong Markov property is the Markov property generalized to stopping times. Standard Brownian motion \( \bs{X} \) is also a strong Markov process. The best way to say this is by a generalization of .
Suppose that \( \tau \) is a stopping time and define \( Y_t = X_{\tau + t} - X_\tau \) for \( t \in [0, \infty) \). Then \( \bs{Y} = \{Y_t: t \in [0, \infty)\} \) is a standard Brownian motion and is independent of \( \mathscr{F}_\tau \).
Many interesting properties of Brownian motion can be obtained from a clever idea known as the reflection principle. As usual, we start with a standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty) \} \). Let \( \tau \) be a stopping time for \( \bs{X} \). Define \[ W_t = \begin{cases} X_t, & 0 \le t \lt \tau \\ 2 X_\tau - X_t, & \tau \le t \lt \infty \end{cases} \] Thus, the graph of \( \bs{W} = \{W_t: t \in [0, \infty)\} \) can be obtained from the graph of \( \bs{X} \) by reflecting in the line \( x = X_\tau \) after time \( \tau \). In particular, if the stopping time \( \tau \) is \( \tau_a \), the first time that the process hits a specified state \( a \gt 0 \), then the graph of \( \bs{W} \) is obtained from the graph of \( \bs{X} \) by reflecting in the line \( x = a \) after time \( \tau_a \).
Open the simulation of reflecting Brownian motion. This app shows the process \( \bs{W} \) corresponding to the the stopping time \( \tau_a \), the time of first visit to a positive state \( a \). Run the simulation in single step mode until you see the reflected process several times. Make sure that you understand how the process \( \bs{W} \) works.
The reflected process \(\bs{W} = \{W_t: t \in [0, \infty)\}\) is also a standard Brownian motion.
Run the simulation of the reflected Brownian motion process 1000 times. Compaure the empirical density function and moments of \( W_t \) to the true probability density function and moments.
As usual, let \( \bs{X} = \{X_t: t \in [0, \infty)\} \) be a standard Brownian motion, and let \( \mathscr{F}_t = \sigma\{X_s: 0 \le s \le t\} \) for \( t \in [0, \infty) \), so that \( \mathfrak{F} = \{\mathscr{F}_t: t \in [0, \infty)\} \) is the natural filtration for \( \bs{X} \). There are several important martingales associated with \( \bs{X} \). We will study a couple of them in this section, and others in subsequent sections. Our first result is that \( \bs{X} \) itself is a martingale, simply by virtue of having stationary, independent increments and 0 mean.
\( \bs{X} \) is a martingale with respect to \( \mathfrak{F} \).
Again, this is true of any process with stationary, independent increments and 0 mean, but we give the proof anyway, for completeness. Let \( s, \, t \in [0, \infty) \) with \( s \lt t \). Since \( X_s \) is measurable with respect to \( \mathscr{F}_s \) and \( X_t - X_s \) is independent of \( \mathscr{F}_s \) we have \[ \E\left(X_t \mid \mathscr{F}_s\right) = \E\left[X_s + (X_t - X_s) \mid \mathscr{F}_s\right] = X_s + \E(X_t - X_s) = X_s\]
The next martingale is a little more interesting.
Let \( Y_t = X_t^2 - t \) for \( t \in [0, \infty) \). Then \( \bs{Y} = \{Y_t: t \in [0, \infty)\} \) is a martingale with respect to \( \mathfrak{F} \).
Let \( s, \, t \in [0, \infty) \) with \( s \lt t \). Then \[ Y_t = X_t^2 - t = \left[X_s + (X_t - X_s)\right]^2 - t = X_s^2 + 2 X_s (X_t - X_s) + (X_t - X_s)^2 - t \] Since \( X_s \) is measurable with respect to \( \mathscr{F}_s \) and \( X_t - X_s \) is independent of \( \mathscr{F}_s \) we have \[ \E\left(Y_t \mid \mathscr{F}_s\right) = X_s^2 + 2 X_s \E(X_t - X_s) + \E\left[(X_t - X_s)\right]^2 - t \] But \( \E(X_t - X_s) = 0 \) and \( \E\left[(X_t - X_s)^2\right] = \var(X_t - X_s) = t - s \) so \( \E\left(Y_t \mid \mathscr{F}_s\right) = X_s^2 - s = Y_s \).
As usual, we start with a standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty) \} \). For \( y \in [0, \infty) \) recall that \( \tau_y = \min\{t \ge 0: X_t = y\} \) is the first time that the process hits state \( y \). Of course, \( \tau_0 = 0 \). For \( t \in [0, \infty) \), let \( Y_t = \5\{X_s: 0 \le s \le t\} \), the maximum value of \( \bs{X} \) on the interval \( [0, t] \). Note that \( Y_t \) is well defined by the continuity of \( \bs{X} \), and of course \( Y_0 = 0 \). Thus we have two new stochastic processes: \( \{\tau_y: y \in [0, \infty)\} \) and \( \{Y_t: t \in [0, \infty)\} \). Both have index set \( [0, \infty) \) and (as we will see) state space \( [0, \infty) \). Moreover, the processes are inverses of each other in a sense:
For \( t, \; y \in (0, \infty) \), \( \tau_y \le t \) if and only if \( Y_t \ge y \).
Since standard Brownian motion starts at 0 and is continuous, both events mean that the the process hits state \( y \) in the interval \( [0, t] \).
Thus, if we can compute the distribution of \( Y_t \) for each \( t \in (0, \infty) \) then we can compute the distribution of \( \tau_y \) for each \( y \in (0, \infty) \), and conversely.
For \( y \gt 0 \), \( \tau_y \) has the same distribution as \( y^2 \big/ Z^2 \), where \( Z \) is a standard normal variable. The probability density function \( g_y \) is given by \[ g_y(t) = \frac{y}{\sqrt{2 \pi t^3}} \exp\left(-\frac{y^2}{2 t}\right), \quad t \in (0, \infty) \]
Let \( t \gt 0 \). From , note that \( X_t \ge y \implies Y_t \ge y \implies \tau_y \le t \). Hence \[ \P(X_t \ge y) = \P(X_t \ge y, \tau_y \le t) = \P(X_t \ge y \mid \tau_y \le t) \P(\tau_y \le t) \] But from the strong Markov property , \( s \mapsto X(\tau_y + s) - y \) is another standard Brownian motion. Hence \( \P(X_t \ge y \mid \tau_y \le t) = \frac{1}{2} \). Therefore \[ \P(\tau_y \le t) = 2 \P(X_t \ge y) = \frac{2}{\sqrt{2 \pi t}} \int_y^\infty e^{-x^2 / 2 t} \, dx = \frac{2}{\sqrt{2 \pi}} \int_{y/\sqrt{t}}^\infty e^{-z^2/2} \, dz \] The second integral follows from the first by the change of variables \( z = x \big/ \sqrt{t} \). We can recognize this integral as \( \P\left(y^2 \big/ Z^2 \le t\right) \) where \( Z \) has a standard normal distribution. Taking the derivative of the integral with respect to \( t \) gives the PDF.
The distribution of \( \tau_y \) is the Lévy distribution with scale parameter \( y^2 \), and is named for the French mathematician Paul Lévy. The Lévy distribution is studied in more detail in the chapter on special distributions.
Open the simulation of refelcted Brownian motion again. Note the shape and location of the probability density function of \( \tau \), the hitting time to state 1. Run the simulation in single step mode a few times. Then run the experiment 1000 times and compare the empirical density function to the probability density function.
Open the special distribution simulator and select the Lévy distribution. Vary the parameters and note the shape and location of the probability density function. For selected values of the parameters, run the simulation 1000 times and compare the empirical density function to the probability density function.
Standard Brownian motion is recurrent. That is, \( \P(\tau_y \lt \infty) = 1 \) for every \( y \in \R \).
Suppose first that \( y \gt 0 \). From the proof of , \[ \P(\tau_y \lt \infty) = \lim_{t \to \infty} \P(\tau_y \le t) = \frac{2}{\sqrt{2 \pi}} \int_0^\infty e^{-z^2 / 2} \, dz = 1 \] Note that the integral above is equivalent to the integral of the standard normal PDF over \( \R \). In particular, the function \( g_y \) given above really is a valid PDF. If \( y \lt 0 \) then by symmetry, \( \tau_y \) has the same distribution as \( \tau_{-y} \), so \( \P(\tau_y \lt \infty) = 1 \). Trivially, \( \tau_0 = 0 \).
Thus, for each \( y \in \R \), \( \bs{X} \) eventually hits \( y \) with probability 1. Actually we can say more:
With probability 1, \( \bs{X} \) visits every point in \( \R \).
By continuity, if \( \bs{X} \) reaches \( y \gt 0 \) then \( \bs{X} \) visits every point in \( [0, y] \). By symmetry, a similar statement holds for \( y \lt 0\). Thus the event that \( \bs{X} \) visits every point in \( \R \) is \( \bigcap_{n=1}^\infty \left(\{\tau_n \lt \infty\} \cap \{\tau_{-n} \lt \infty\}\right) \). The probability of a countable intersection of events with probability 1 still has probability 1.
On the other hand,
Standard Brownian motion is null recurrent. That is, \( \E(\tau_y) = \infty \) for every \( y \in \R \setminus \{0\} \).
By symmetry, it suffices to consider \( y \gt 0 \). From , \[ \E(\tau_y) = \int_0^\infty \P(\tau_y \gt t) \, dt = \frac{2}{\sqrt{2 \pi}} \int_0^\infty \int_0^{y / \sqrt{t}} e^{-z^2 / 2} \, dz \, dt \] Changing the order of integration gives \[ \E(\tau_y) = \frac{2}{\sqrt{2 \pi}} \int_0^\infty \int_0^{y^2/z^2} e^{-z^2 / 2} \, dt \, dz = \frac{2 y^2}{\sqrt{2 \pi}} \int_0^\infty \frac{1}{z^2} e^{-z^2 / 2} \, dz\] Next we get a lower bound on the last integral by integrating over the interval \( [0, 1] \) and noting that \( e^{-z^2 / 2} \ge e^{-1/2} \) on this integral. Thus, \[ \E(\tau_y) \ge \frac{2 y^2 e^{-1/2}}{\sqrt{2 \pi}} \int_0^1 \frac{1}{z^2} \, dz = \infty \]
The process \( \{\tau_x: x \in [0, \infty)\} \) has stationary, independent increments.
The proof relies on the temporal and spatial homogeneity of Brownian motion and the strong Markov property. Suppose that \( x, \; y \in [0, \infty) \) with \( x \lt y \). By continuity, \( \bs{X} \) must reach \( x \) before reaching \( y \). Thus, \( \tau_y = \tau_x + (\tau_y - \tau_x) \). But \( \tau_y - \tau_x \) is the hitting time to \( y - x \) for the process \( t \mapsto X(\tau_x + t) - x \), and as shown in , this process is also a standard Brownian motion, independent of \( \mathscr{F}(\tau_x) \). Hence \( \tau_y - \tau_x \) is independent of \( \mathscr{F}(\tau_x) \) and has the same distribution as \( \tau_{y-x} \).
The family of probability density functions \( \{g_x: x \in (0, \infty)\} \) is closed under convolution. That is, \( g_x * g_y = g_{x+y} \) for \( x, \, y \in (0, \infty) \).
Now we turn our attention to the maximum process \( \{Y_t: t \in [0, \infty)\} \), the inverse
of the hitting process \( \{\tau_y: y \in [0, \infty)\} \).
For \( t \gt 0 \), \( Y_t \) has the same distribution as \( \left|X_t\right| \), known as the half-normal distribution with scale parameter \( t \). The probability density function is
\[ h_t(y) = \sqrt{\frac{2}{\pi t}} \exp\left(-\frac{y^2}{2 t}\right), \quad y \in [0, \infty) \]From and , \( \P(Y_t \ge y) = \P(\tau_y \le t) = 2 \P(X_t \ge y) = \P\left(\left|X_t\right| \ge y\right) \) for \( y \ge 0 \). By definition, \( \left|X_t\right| \) has the half-normal distribution with parameter \( t \). In particular, \[ \P(Y_t \ge y) = \frac{2}{\sqrt{2 \pi t}} \int_y^\infty e^{-x^2 / 2 t} \, dx \] Taking the negative derivative of the integral above, with respect to \( y \), gives the PDF.
The half-normal distribution is a special case of the folded normal distribution, which is studied in more detail in the chapter on special distributions.
For \( t \ge 0 \), the mean and variance of \( Y_t \) are
These follow from standard results for the half-normal distribution.
In the standard Brownian motion simulation, select the maximum value. Vary the parameter \( t \) and note the shape of the probability density function and the location and size of the mean-standard deviation bar. Run the simulation 1000 times and compare the empirical density and moments to the true probability density function and moments.
Open the special distribution simulator and select the folded-normal distribution. Vary the parameters and note the shape and location of the probability density function and the size and location of the mean-standard deviation bar. For selected values of the parameters, run the simulation 1000 times and compare the empirical density function and moments to the true density function and moments.
As usual, we start with a standard Brownian motion \( \bs{X} = \{X_t: t \in [0, \infty)\} \). Study of the zeros of \( \bs{X} \) lead to a number of probability laws referred to as arcsine laws, because as we might guess, the probabilities and distributions involve the arcsine function.
For \( s, \; t \in [0, \infty) \) with \( s \lt t \), let \( E(s, t) \) be the event that \( \bs{X} \) has a zero in the time interval \( (s, t) \). That is, \( \E(s, t) = \{X_u = 0 \text{ for some } u \in (s, t)\} \). Then \[ \P\left[E(s, t)\right] = 1 - \frac{2}{\pi} \arcsin\left(\sqrt{\frac{s}{t}}\right) \]
Conditioning on \( X_s \) and using symmetry gives \[ \P\left[E(s, t)\right] = \int_{-\infty}^\infty \P\left[E(s, t) \mid X_s = x\right] f_s(x) \, dx = 2 \int_{-\infty}^0 \P\left[E(s, t) \mid X_s = x\right] f_s(x) \, dx \] But by the homogeneity of \( \bs{X} \) in time and space, note that for \( x \gt 0 \), \( \P\left[E(s, t) \mid X_s = -x\right] = \P(\tau_x \lt t - s) \). That is, a process in state \( -x \) at time \( s \) that hits 0 before time \( t \) is the same as a process in state 0 at time 0 reaching state \( x \) before time \( t - s \). Hence \[ \P\left[E(s, t)\right] = \int_0^\infty \int_0^{t-s} g_x(u) f_s(-x) \, du \, dx \] where \( g_x \) is the PDF of \( \tau_x \) from . Substituting gives \[ \P\left[E(s, t)\right] = \frac{1}{\pi \sqrt{s}} \int_0^{t-s} u^{-3/2} \int_0^\infty x \exp\left[-\frac{1}{2} x^2 \left(\frac{u + s}{u s} \right) \right] \, dx \, du = \frac{\sqrt{s}}{\pi} \int_0^{t-s} \frac{1}{(u + s) \sqrt{u}} \, du\] Finally substituting \( v = \sqrt{u / s} \) in the last integral give \[ \P\left[E(s, t)\right] = \frac{2}{\pi} \int_0^{\sqrt{t/s - 1}} \frac{1}{v^2 + 1} \, dv = \frac{2}{\pi} \arctan \left(\sqrt{\frac{t}{s} - 1}\right) = 1 - \frac{2}{\pi} \arcsin\left(\sqrt{\frac{s}{t}} \right) \]
In paricular, \( \P\left[E(0, t)\right] = 1 \) for every \( t \gt 0 \), so with probability 1, \( \bs{X} \) has a zero in \( (0, t) \). Actually, we can say a bit more:
For \( t \gt 0 \), \( \bs{X} \) has infinitely many zeros in \( (0, t) \) with probability 1.
The event that \( \bs{X} \) has infinitely many zeros in \( (0, t) \) is \( \bigcap_{n=1}^\infty E(0, t / n) \). The intersection of a countable collection of events with probability 1 still has probability 1.
Theorem is further evidence of the very strange and irregular behavior of Brownian motion. Note also that \( \P\left[E(s, t)\right] \) depends only on the ratio \( s / t \). Thus, \( \P\left[E(s, t)\right] = \P\left[E(1 / t, 1 / s)\right]\) and \(\P\left[E(s, t)\right] = \P\left[E(c s, c t)\right] \) for every \( c \gt 0 \). So, for example the probability of at least one zero in the interval \( (2, 5) \) is the same as the probability of at least one zero in \( (1/5, 1/2) \), the same as the probability of at least one zero in \( (6, 15) \), and the same as the probability of at least one zero in \( (200, 500) \).
For \( t \gt 0 \), let \( Z_t \) denote the time of the last zero of \( \bs{X} \) before time \( t \). That is, \( Z_t = \max\left\{s \in [0, t]: X_s = 0\right\} \). Then \( Z_t \) has the arcsine distribution with parameter \( t \). The distribution function \( H_t \) and the probability density function \( h_t \) are given by \begin{align} H_t(s) & = \frac{2}{\pi} \arcsin\left(\sqrt{\frac{s}{t}}\right), \quad 0 \le s \le t \\ h_t(s) & = \frac{1}{\pi \sqrt{s (t - s)}}, \quad 0 \lt s \lt t \end{align}
The density function of \( Z_t \) is \( u \)-shaped and symmetric about the midpoint \( t / 2 \), so the points with the largest density are those near the endpoints 0 and \( t \), a surprising result at first. The arcsine distribution is studied in more detail in the chapter on special distributions.
The mean and variance of \( Z_t \) are
These are standard results for the arcsine distribution. That the mean is the midpoint \(t/2\) also follows from symmetry, of course.
In the simulation of standard Brownian motion, select the last zero variable. Vary the parameter \( t \) and note the shape of the probability density function and the size and location of the mean-standard deviation bar. For selected values of \( t \) run the simulation is single step mode a few times and note the position of the last zero. Finally, run the simulation 1000 times and compare the empirical density function and moments to the true probability density function and moments.
Open the special distribution simulator and select the arcsine distribution. Vary the parameters and note the shape and location of the probability density function and the size and location of the mean-standard deviation bar. For selected values of the parameters, run the simulation 1000 times and compare the empirical density function and moments to the true density function and moments.
Now let \( Z = \{t \in [0, \infty): X_t = 0\} \) denote the set of zeros of \( \bs{X} \), so that \( Z \) is a random subset of \( [0, \infty) \). The theorem below gives some of the strange properties of the random set \( Z \), but to understand these, we need to review some definitions. A nowhere dense set is a set whose closure has empty interior. A perfect set is a set with no isolated points. As usual, we let \( \lambda \) denote Lebesgue measure on \( \R \).
With probability 1,
The following theorem gives a deeper property of \( Z \). The Hausdorff dimension of \( Z \) is midway between that of a point (dimension 0) and a line (dimension 1).
\( Z \) has Hausdorff dimension \(\frac{1}{2}\).
As usual, let \( \bs{X} = \{X_t: t \in [0, \infty)\} \) be standard Brownian motion. By definition, we know that \( X_t \) has the normal distribution with mean 0 and standard deviation \( \sqrt{t} \), so the function \( x = \sqrt{t} \) gives some idea of how the process grows in time. The precise growth rate is given by the famous law of the iterated logarithm
With probability 1, \[ \limsup_{t \to \infty} \frac{X_t}{\sqrt{2 t \ln \ln t}} = 1 \]
In the following exercise, \( \bs{X} = \{X_t: t \in [0, \infty)\} \) is a standard Brownian motion process.
Explicitly find the probability density function, covariance matrix, and correlation matrix of \( (X_{0.5}, X_1, X_{2.3}) \).