[This post originates from twitter threads posted on 9 Sep 21 and 2 Feb 22.]

A while ago, I proved the result: A continuous strong Markov martingale is uniquely determined by its marginal distributions. This is discussed in a recent paper by Beiglböck, Pammer, and Schachermayer.

Time for a thread discussing some of these ideas, which have been studied for decades in both stochastic calculus and mathematical finance. Continue reading “Martingale Marginals”→

Time for some #RandomNumberTheory. The Collatz Conjecture is a famous unsolved mathematical problem which also goes by various other names, such as the ‘3n+1’ conjecture. Since it was introduced by Lothar Collatz in 1937, no-one has been able to prove it either true or false.

Brownian bridges were described in a previous post, along with various different methods by which they can be constructed. Since a Brownian bridge on an interval is continuous and equal to zero at both endpoints, we can consider extending to the entire real line by partitioning the real numbers into intervals of length T and replicating the path of the process across each of these. This will result in continuous and periodic sample paths, suggesting another method of representing Brownian bridges. That is, by Fourier expansion. As we will see, the Fourier coefficients turn out to be independent normal random variables, giving a useful alternative method of constructing a Brownian bridge.

There are actually a couple of distinct Fourier expansions that can be used, which depends on precisely how we consider extending the sample paths to the real line. A particularly simple result is given by the sine series, which I describe first. This is shown for an example Brownian bridge sample path in figure 1 above, which plots the sequence of approximations formed by truncating the series after a small number of terms. This tends uniformly to the sample path, although it is quite slow to converge as should be expected when approximating such a rough path by smooth functions. Also plotted, is the series after the first 100 terms, by which time the approximation is quite close to the target. For simplicity, I only consider standard Brownian bridges, which are defined on the unit interval . This does not reduce the generality, since bridges on an interval can be expressed as scaled versions of standard Brownian bridges.

Theorem 1 A standard Brownian bridge B can be decomposed as

(1)

over , where is an IID sequence of standard normals. This series converges uniformly in t, both with probability one and in the norm for all .

A Brownian bridge can be defined as standard Brownian motion conditioned on hitting zero at a fixed future time T, or as any continuous process with the same distribution as this. Rather than conditioning, a slightly easier approach is to subtract a linear term from the Brownian motion, chosen such that the resulting process hits zero at the time T. This is equivalent, but has the added benefit of being independent of the original Brownian motion at all later times.

Lemma 1 Let X be a standard Brownian motion and be a fixed time. Then, the process

(1)

over is independent from .

Proof: As the processes are joint normal, it is sufficient that there is zero covariance between them. So, for times , we just need to show that is zero. Using the covariance structure we obtain,

as required. ⬜

This leads us to the definition of a Brownian bridge.

Definition 2 A continuous process is a Brownian bridge on the interval if and only it has the same distribution as for a standard Brownian motion X.

In case that , then B is called a standard Brownian bridge.

There are actually many different ways in which Brownian bridges can be defined, which all lead to the same result.

As a Brownian motion minus a linear term so that it hits zero at T. This is definition 2.

As a Brownian motion X scaled as . See lemma 9 below.

As a joint normal process with prescribed covariances. See lemma 7 below.

As a Brownian motion conditioned on hitting zero at T. See lemma 14 below.

As a Brownian motion restricted to the times before it last hits zero before a fixed positive time T, and rescaled to fit a fixed time interval. See lemma 15 below.

As a solution to a stochastic differential equation with drift term forcing it to hit zero at T. See lemma 18 below.

There are other constructions beyond these, such as in terms of limits of random walks, although I will not cover those in this post. Continue reading “Brownian Bridges”→

A well known fact about joint normally distributed random variables, is that they are independent if and only if their covariance is zero. In one direction, this statement is trivial. Any independent pair of random variables has zero covariance (assuming that they are integrable, so that the covariance has a well-defined value). The strength of the statement is in the other direction. Knowing the value of the covariance does not tell us a lot about the joint distribution so, in the case that they are joint normal, the fact that we can determine independence from this is a rather strong statement.

Theorem 1 A joint normal pair of random variables are independent if and only if their covariance is zero.

Proof: Suppose that X,Y are joint normal, such that and , and that their covariance is c. Then, the characteristic function of can be computed as

for all . It is standard that the joint characteristic function of a pair of random variables is equal to the product of their characteristic functions if and only if they are independent which, in this case, corresponds to the covariance c being zero. ⬜

Example 1 A pair of standard normal random variables X,Y which have zero covariance, but is not normal.

As their sum is not normal, X and Y cannot be independent. This example was constructed by setting for some fixed , which is standard normal whenever X is. As explained in the previous post, the intermediate value theorem ensures that there is a unique value for K making the covariance equal to zero. Continue reading “Independence of Normals”→

I looked at normal random variables in an earlier post but, what does it mean for a sequence of real-valued random variables to be jointly normal? We could simply require each of them to be normal, but this says very little about their joint distribution and is not much help in handling expressions involving more than one of the at once. In case that the random variables are independent, the following result is a very useful property of the normal distribution. All random variables in this post will be real-valued, except where stated otherwise, and we assume that they are defined with respect to some underlying probability space .

Lemma 1 Linear combinations of independent normal random variables are again normal.

Proof: More precisely, if is a sequence of independent normal random variables and are real numbers, then is normal. Let us suppose that has mean and variance . Then, the characteristic function of Y can be computed using the independence property and the characteristic functions of the individual normals,

where we have set and . This is the characteristic function of a normal random variable with mean and variance . ⬜

The definition of joint normal random variables will include the case of independent normals, so that any linear combination is also normal. We use use this result as the defining property for the general multivariate normal case.

Definition 2 A collection of real-valued random variables is multivariate normal (or joint normal) if and only if all of its finite linear combinations are normal.

The famous Riemann zeta function was first introduced by Riemann in order to describe the distribution of the prime numbers. It is defined by the infinite sum

(1)

which is absolutely convergent for all complex s with real part greater than one. One of the first properties of this is that, as shown by Riemann, it extends to an analytic function on the entire complex plane, other than a simple pole at . By the theory of analytic continuation this extension is necessarily unique, so the importance of the result lies in showing that an extension exists. One way of doing this is to find an alternative expression for the zeta function which is well defined everywhere. For example, it can be expressed as an absolutely convergent integral, as performed by Riemann himself in his original 1859 paper on the subject. This leads to an explicit expression for the zeta function, scaled by an analytic prefactor, as the integral of multiplied by a function of x over the range . In fact, this can be done in a way such that the function of x is a probability density function, and hence expresses the Riemann zeta function over the entire complex plane in terms of the generating function of a positive random variable X. The probability distributions involved here are not the standard ones taught to students of probability theory, so may be new to many people. Although these distributions are intimately related to the Riemann zeta function they also, intriguingly, turn up in seemingly unrelated contexts involving Brownian motion.

The normal (or Gaussian) distribution is ubiquitous throughout probability theory for various reasons, including the central limit theorem, the fact that it is realistic for many practical applications, and because it satisfies nice properties making it amenable to mathematical manipulation. It is, therefore, one of the first continuous distributions that students encounter at school. As such, it is not something that I have spent much time discussing on this blog, which is usually concerned with more advanced topics. However, there are many nice properties and methods that can be performed with normal distributions, greatly simplifying the manipulation of expressions in which it is involved. While it is usually possible to ignore these, and instead just substitute in the density function and manipulate the resulting integrals, that approach can get very messy. So, I will describe some of the basic results and ideas that I use frequently.

Throughout, I assume the existence of an underlying probability space . Recall that a real-valued random variable X has the standard normal distribution if it has a probability density function given by,

For it to function as a probability density, it is necessary that it integrates to one. While it is not obvious that the normalization factor is the correct value for this to be true, it is the one fact that I state here without proof. Wikipedia does list a couple of proofs, which can be referred to. By symmetry, and have the same distribution, so that they have the same mean and, therefore, .

The derivative of the density function satisfies the useful identity

(1)

This allows us to quickly verify that standard normal variables have unit variance, by an application of integration by parts.

Another identity satisfied by the normal density function is,

(2)

This enables us to prove the following very useful result. In fact, it is difficult to overstate how helpful this result can be. I make use of it frequently when manipulating expressions involving normal variables, as it significantly simplifies the calculations. It is also easy to remember, and simple to derive if needed.

Theorem 1 Let X be standard normal and be measurable. Then, for all ,

Here, I apply the theory outlined in the previous post to fully describe the drawdown point process of a standard Brownian motion. In fact, as I will show, the drawdowns can all be constructed from independent copies of a single ‘Brownian excursion’ stochastic process. Recall that we start with a continuous stochastic process X, assumed here to be Brownian motion, and define its running maximum as and drawdown process . This is as in figure 1 above.

Next, was defined to be the drawdown ‘excursion’ over the interval at which the maximum process is equal to the value . Precisely, if we let be the first time at which X hits level and be its right limit then,

Next, a random set S is defined as the collection of all nonzero drawdown excursions indexed the running maximum,

The set of drawdown excursions corresponding to the sample path from figure 1 are shown in figure 2 below.

As described in the post on semimartingale local times, the joint distribution of the drawdown and running maximum , of a Brownian motion, is identical to the distribution of its absolute value and local time at zero, . Hence, the point process consisting of the drawdown excursions indexed by the running maximum, and the absolute value of the excursions from zero indexed by the local time, both have the same distribution. So, the theory described in this post applies equally to the excursions away from zero of a Brownian motion.

Before going further, let’s recap some of the technical details. The excursions lie in the space E of continuous paths , on which we define a canonical process Z by sampling the path at each time t, . This space is given the topology of uniform convergence over finite time intervals (compact open topology), which makes it into a Polish space, and whose Borel sigma-algebra is equal to the sigma-algebra generated by . As shown in the previous post, the counting measure is a random point process on . In fact, it is a Poisson point process, so its distribution is fully determined by its intensity measure .

Theorem 1 If X is a standard Brownian motion, then the drawdown point process is Poisson with intensity measure where,

is the standard Lebesgue measure on .

is a sigma-finite measure on E given by

(1)

for all bounded continuous continuous maps which vanish on paths of length less than L (some ). The limit is taken over , denotes expectation under the measure with respect to which Z is a Brownian motion started at , and is the first time at which Z hits 0. This measure satisfies the following properties,

-almost everywhere, there exists a time such that on and everywhere else.

for each , the distribution of has density

(2)

over the range .

over , is Markov, with transition function of a Brownian motion stopped at zero.

For a continuous real-valued stochastic process with running maximum , consider its drawdown. This is just the amount that it has dropped since its maximum so far,

which is a nonnegative process hitting zero whenever the original process visits its running maximum. By looking at each of the individual intervals over which the drawdown is positive, we can break it down into a collection of finite excursions above zero. Furthermore, the running maximum is constant across each of these intervals, so it is natural to index the excursions by this maximum process. By doing so, we obtain a point process. In many cases, it is even a Poisson point process. I look at the drawdown in this post as an example of a point process which is a bit more interesting than the previous example given of the jumps of a cadlag process. By piecing the drawdown excursions back together, it is possible to reconstruct from the point process. At least, this can be done so long as the original process does not monotonically increase over any nontrivial intervals, so that there are no intervals with zero drawdown. As the point process indexes the drawdown by the running maximum, we can also reconstruct X as . The drawdown point process therefore gives an alternative description of our original process.

See figure 1 for the drawdown of the bitcoin price valued in US dollars between April and December 2020. As it makes more sense for this example, the drawdown is shown as a percent of the running maximum, rather than in dollars. This is equivalent to the approach taken in this post applied to the logarithm of the price return over the period, so that . It can be noted that, as the price was mostly increasing, the drawdown consists of a relatively large number of small excursions. If, on the other hand, it had declined, then it would have been dominated by a single large drawdown excursion covering most of the time period.

For simplicity, I will suppose that and that tends to infinity as t goes to infinity. Then, for each , define the random time at which the process first hits level ,

By construction, this is finite, increasing, and left-continuous in . Consider, also, the right limits . Each of the excursions on which the drawdown is positive is equal to one of the intervals . The excursion is defined as a continuous stochastic process equal to the drawdown starting at time and stopped at time ,

This is a continuous nonnegative real-valued process, which starts at zero and is equal to zero at all times after . Note that there uncountably many values for but, the associated excursion will be identically zero other than for the countably many times at which . We will only be interested in these nonzero excursions.

As usual, we work with respect to an underlying probability space , so that we have one path of the stochastic process X defined for each . Associated to this is the collection of drawdown excursions indexed by the running maximum.

As S is defined for each given sample path, it depends on the choice of , so is a countable random set. The sample paths of the excursions lie in the space of continuous functions , which I denote by E. For each time , I use to denote the value of the path sampled at time t,

Use to denote the sigma-algebra on E generated by the collection of maps , so that is the measurable space in which the excursion paths lie. It can be seen that is the Borel sigma-algebra generated by the open subsets of E, with respect to the topology of compact convergence. That is, the topology of uniform convergence on finite time intervals. As this is a complete separable metric space, it makes into a standard Borel space.

Lemma 1 The set S defines a simple point process on ,

for all .

From the definition of point processes, this simply means that is a measurable random variable for each and that there exists a sequence covering E such that are almost surely finite. The set of drawdowns for the point process corresponding to the bitcoin prices in figure 1 are shown in figure 2 below.