Mathematics and Economics

Archive for the ‘Mathematics’ Category

Ross Recovery

In Bubbles and Crashes, Economics, Finance, Mathematics on September 3, 2020 at 1:44 am

In this post, we discuss the interesting paper by the late Steve Ross,”The Recovery Theorem”, in which a method is proposed to disentangle the risk aversion component from the subjective probability measure from state prices. In particular, a method is proposed to back out the market’s forecast of returns (a distribution over returns) from option prices.

Overview

State prices are the product of risk aversion—the pricing kernel—and the natural probability distribution. From derivatives prices we can observe distribution of state prices. The question then becomes: can we separate the markets probability distribution over returns and risk aversion?  For example, we would like to know, given forward rates, how much of the rate is due to the market’s forecast and how much is a risk premium. In models with a representative agent, this is equivalent to knowing both the agent’s risk aversion and the agent’s subjective probability distribution, neither of which is observable but instead, inferred from calibrating market models.

Ross finds a decomposition of state prices into a risk adjustment and the natural probability distribution assuming that the pricing kernel is irreducible and transition independent (defined below). He calls this a recovery theorem. He proves his recovery theorem in two settings: finite state space, and a multinomial (potentially countably infinite) state space. The decomposition then allows us to express the market transition probabilities in terms of the stochastic discount factor and state prices, both of which can be estimated. The proof of the finite state space is essentially a fairly straight forward application of the Perron-Frobenius theorem. The proof of the result in the multinomial setting requires an additional assumption and follows from an unclear proof by (implicit) induction.

As a corollary to the recovery theorem, the subjective discount rate is shown to be bounded above by the largest interest factor. In addition, in the finite state case, if the riskless rate is state independent, then pricing is shown to be risk neutral. This is a very surprising result and in fact does not hold true for the countably infinite multinomial case. At the moment, I do not have good intuition for this result, but Ross claims that it is an artifact of having a finite irreducible process for a state transition (see bottom of pg 623).

Ross then goes on to demonstrate the recovery theory in two different ways. First, he shows for a “static” example, that given both the utility function (CRRA in his example) and the stock price distribution (lognormal) that using the recovery theorem, one can recover the natural probability measure using the pricing kernel (SDF) and the state prices. In the given example, the utility function and the price distribution are used to derive the expressions for the SDF and the state prices (through the Black-Scholes-Merton formula). He then calibrates the standard deviation and mean return of the price process (price distribution) to market data and shows that the resulting recovered transition probability distribution coincides with the lognormal distribution. This section (Section IV) proves to be deeper than just a verification of the theorem for an example.  First, Ross points out that although the theorem was proven for the discrete and multinomial cases, it still seems to recover with a continuous distribution when considering a static problem (moving from one known initial state to an unknown state). However, once the dynamic problem is considered where one first transitions from a known state to an unknown state, then from the unknown state to another unknown state (from time 0 information set perspective), problems arise in that no implicit truncation of the distribution can be used. Details on this will be given below.

In section V, the recovery theorem is applied to the S&P 500 index to recover the market transition probabilities on April 27, 2011. What is remarkable about the recovery method is that it doesn’t need a training set. That is no historical data is explicitly needed to recover the distribution. The only place that Ross makes use of historical data is for the sake of comparison. Using historical returns, he constructs a bootstrapped histogram of returns and compares it to the recovered histogram of returns.

In the last section, a “model-free” test of the efficient market hypothesis (EMH) is proposed that essentially bounds the R^2 one can get from a factor model that would still be consistent with the EMH. Thus, any test of an investment strategy that uses publically available information and has the ability to predict future returns with R^2 > 10% would be a violation of efficient markets independent of the specific asset pricing model being used, subject to the maintained assumptions of the recovery theorem. Of course, such a strategy must also overcome transactions costs to really be a violation. His bound doesn’t take into account any transactions costs.

Basic Framework (§ II-III)

The basic framework is a discrete-time world with asset payoffs g(\theta) at time $ latex T$, contingent on the state θ∈Ω. From the fundamental theorem of asset pricing (FTAC), no arbitrage implies the existence of a positive state space prices, p(θ) (or in more general spaces, a price distribution function P(\theta)). The current value p_g of an asset paying g(\theta) in period T is given by

Where an asterisk denotes the expectation with respect to the martingale measure and where the pricing kernel, \phi(\theta) is the Radon-Nikodym derivative of P(\theta) with respect to the natural (subjective) measure, F(\theta) or in the case of continuous distributions, \phi(\theta)  = p(\theta)/f(\theta) , where f is the subjective pdf. The risk neutral probabilities are given by \Pi^*(\theta) = \frac{p(\theta}{\int p(\theta)d\theta}= \exp(r(\theta_0)Tp(\theta)

Our first assumption is that the asset value follows a Markov process. Ignoring the effects of the time value of money temporarily, the (martingale) transition density function, \mathbf{Q}, must satisfy the Chapman-Kolmogorov equation:

for any T<t The idea behind (3) is that the probability of transitioning from state \theta_i to \theta_j from time 0 to time T can be decomposed into the total probability of first transitioning to some arbitrary state \theta at the intermediate time t and then transitioning to the state \theta_j time T. Furthermore, since Q is a martingale measure, we also get time homogeneity which is why we can view everything from the time zero perspective, i.e. instead of thinking about the transition density from t to T we can just think about the transition density from 0 to T-t.

Taking back into account the time value of money, and making the second assumption that the process is time homogenous, the state price distribution is given by

Under the Markov assumption and assuming a continuous distribution for illustrative purposes, the kernel (state price per unit of probability (density)) as

In the familiar world of a representative agent with additive time-separable preferences we get

Most likely inspired by this form, Ross imposes the third assumption of transition independence on the kernel:

More general preferences than additive time-separable utility satisfy this form such as Epstein-Zin recursive preferences. At this point, we should pause to reflect how much this assumption has bought us. If we look at the LHS, in discrete time and state space world with m states, it will be a matrix with up to m\times m degrees of freedom whereas the RHS just has m+1 degrees of freedom (h takes on m different values, and \delta is also unknown). Thus, we reduced our search from m^2 to m+1.

From (9) and (10) above, we obtain an expression for state prices

In what follows, we specialize our discussion to a discrete state space model. Let

where U_i := U(c(\theta_i)) or more generally, U' is any positive function of the state. Rewriting (11) in matrix form, we get

We can then express the natural transition matrix F as

In addition, since F is a transition matrix, its rows must sum to one, we have the additional set of m constraints:

Rearranging, we get the characteristic root problem:

Finally we make our fourth assumption that P is irreducible which allows us to use the Perron-Frobenius Theorem. One of the results of the theorem is that all non-negative irreducible matrices have a unique positive characteristic vector, z and associated eigenvalue \lambda which corresponds to our lambda. This essentially gives us the main theorem:

From this, we have that \delta is the maximum characteristic root of the price transition matrix, P. Furthermore, another result of Perron-Frobenius gives us that this root is bounded above by the maximum row sum of P, which are the interest rate factors.

Furthermore, if the riskless rate is the same in all states, we get the surprising result

Multinomial Recovery (§ III)

Here Ross extends the theorem to an infinite horizon multinomial Lucus tree setting. It’s useful to note that three of the four sufficient conditions discussed hold in this setting. First, it is still a Markov process. Second, transition independence is directly assumed from assuming time additive utility set-up so that state prices will have the form of (10). Third, irreducibility still holds as any state almost surely is revisited in finite time. The assumption which is not met is the time independence assumption. The payoffs of the tree grow (or shrink) with time so it is another state variable. Under these assumptions we get Theorem 4:

An Example, Comments, and Extensions (§ IV)

In this section, Ross goes on to demonstrate the recovery theory in two different ways: first, he shows for a “static” example, that given both the utility function (CRRA in his example) and the stock price distribution (lognormal) that using the recovery theorem, one can recover the natural probability measure using the pricing kernel (SDF) and the state prices. In the given example, the utility function and the price distribution are used to derive the expressions for the SDF and the state prices (through the Black-Scholes-Merton formula). He then calibrates the standard deviation and mean return of the price process (price distribution) to market data and shows that the resulting recovered transition probability distribution coincides with the lognormal distribution. This section (Section IV) proves to be deeper than just a verification of the theorem for an example.  First, Ross points out that although the theorem was proven for the discrete and multinomial cases, it still seems to recover with a continuous distribution when considering a static problem (moving from one known initial state to an unknown state). However, once the dynamic problem is considered where one first transitions from a known state to an unknown state, then from the unknown state to another unknown state (from time 0 information set perspective), problems arise in that no implicit truncation of the distribution can be used (see pg 632-633).

Applying the Recovery Theorem (§ V)

In this section, Ross relying on a rich market for European options to numerically approximate the state prices. To do so, we first note that a European call price with strike K and time of maturity T can be expressed as

From Breeden and Litzenberger (1978), and intuitively from naively applying the FTC, we have p(K,T) = C_{kk}(K,T) which is approximated numerically from the second differences of the observed call prices.

To apply the Recovery Theorem, we first have to estimate the m\times m state price transition matrix.

Now, to index the states, we think of there being m possible states at any time 0 and time T – there is no growth in this formulation as in the multinomial model. Ross’s notation in this section is pretty terrible, but for the sake of comparability with the paper I will maintain it and do my best to explain it. First, we denote each row of the transition matrix from time 0 to T, p^T, by p^T(c) where c denotes the current state at time 0.

The arguments (k, T) denote the state at time T—the current state notation is suppressed in the vector list. This same notation is used in (83). Next, we denote P as the one period transition matrix. . One of the rows of P we get by using (83) to find the entries of p^1(c) (cf. (85)). To find the rest of the entries of P, we use the following Markovian relationship

where m is the number of states. This is a system of m^2 equations in the m^2 variables P_{ij}, and since we know current state prices, we can solve this.

Figure 2 show the recovered densities vs the bootstrapped ones. Ross points out that the recovered density has a fatter left tail and suggests that this provides support to the recovery method as we should expect the subjective density to have a fatter left tail (fear of disaster) than the actual probability density.

Testing the Efficient Market Hypothesis (§ VI)

In Ross (2005), an alternative test to testing the EMH by finding an upper bound to the volatility of the pricing kernel is proposed. The recovery method allows us to find a number for this upper bound. In particular, from the Hansen-Jagannathan bound there is a lower bound on the volatility of the pricing kernel, \phi:

Recovery gives us an estimate \sigma^2(\phi) = 0.1065. Next, we can decompose excess returns, x_t, on an asset or portfolio strategy as (see Ross(2005))

Rearranging and recalling (87) yields an upper bound on the R^2 of the regression:

Given the estimate of \sigma^2(\phi) and interest rates at 0, this means that 10% of the annual variability of an asset (or portfolio) return is the maximum amount that can be attributed to movements in the pricing kernel with 90% idiosyncratic in an efficient market.

Bubbles and Crashes: The Local Martingale Characterization of Asset Price Bubbles

In Bubbles and Crashes, Economics, Finance, Mathematics on July 17, 2020 at 3:59 pm

We resume our Bubbles and Crashes series with this post discussing the recent influential works of Robert Jarrow and Phillip Protter on the characterization of bubbles as Local Martingales: The Local Martingale Characterization of Bubbles pdf

246A: Complex Analysis, Notes 2 – Meromorphic Functions and Properties of Analytic Functions

In Mathematics on February 10, 2011 at 2:24 am

We continue with a discussion about meromorphic functions and the properties of analytic functions. Later notes will consider the Riemann mapping theorem, harmonic functions and the Dirichlet problem among other topics.

Definition 2.1 A function {f} on an open set {\Omega} is meromorphic if there exists a discrete set of points {S = \left\{z: z \in \Omega\right\}} such that {f} is holomorphic on {\Omega\setminus S} and has poles at each {z \in S}. Furthermore, {f} is meromorphic in the extended complex plane if {F(z) = f(1/z)} is either meromorphic or holomorphic at {0}. In this case we say that {f} has a pole or is holomorphic at infinity.

By collecting results from the previous section, we are immediately led to the following proposition regarding the Laurent expansions of complex valued functions.

Proposition 2.2 Let {S} be the discrete set of singularities of a complex function {f:\Omega \rightarrow \mathbb{C}} where {\Omega} is an open set in {\mathbb{C}}. For a fixed {z_{0} \in S}, suppose the Laurent expansion for {f} in an annulus about {z_{0}} is given by {\sum_{-\infty}^{\infty}a_{n}(z-z_{0})^{n}}. Then,

  1. The function {f} has a removable singularity at {z_{0}} if and only if {a_{n} = 0} for all {n < 0}.
  2. The function {f} has a pole at {z_{0}} if and only if there exists {N \in \mathbb{Z}} with {N < 0} such that {a_{n} = 0} for all {n < N}; that is, the Laurent expansion of {f} about {z_{0}} has only finitely many negative terms.
  3. The function {f} has an essential singularity at {z_{0}} if and only if the Laurent expansion of {f} about {z_{0}} has infinitely many negative terms.
  4. Furthermore, {f} is meromorphic on the extended complex plane if and only if there exists {N \in \mathbb{Z}^{+}} such that {a_{n} = 0} for {n > N}.


Read the rest of this entry »

246A: Complex Analysis, Notes 1 – Analytic functions, Cauchy’s formula and singularities.

In Mathematics on January 4, 2011 at 7:36 pm

The following series of posts comprises our introduction to complex analysis as taught by Professor Rowan Killip at the University of California, Los Angeles, during the Fall quarter of 2009. Where necessary, course notes have been supplemented with details written by the authors of this website using assistance from Complex Analysis by Elias Stein and Rami Shakarchi. The basic properties of complex numbers will be assumed allowing us to begin with the definition of a holomorphic (or complex-differentiable) function, the central notion in our study of complex analysis.

The basic properties of complex numbers will be assumed, allowing us to begin with the definition of a holomorphic (or complex-differentiable) function, the central notion in our study of complex analysis.

Definition 1.1 Suppose {\Omega \in \mathbb{C}} is an open set and {f:\Omega \rightarrow \mathbb{C}}. We say {f} is holomorphic (or complex-differentiable) at {z_0 \in \Omega} if there exists {f^{\prime}(z_0) \in \mathbb{C}: f(z) = f(z_0) + f^{\prime}(z_0)(z - z_{0}) + o(\left |z-z_0\right |).} We say {f} is holomorphic on {\Omega} if it has this property for all {z \in \Omega}.

We can rewrite this formula in terms of the real and imaginary parts of {f} to surmise the relationship between complex differentiability and real analytic differentiability. Let {z, z_{0} \in \mathbb{C}} with {z = x+iy} and {z_{0} = x_0 + iy_{0}}, {x, y, x_0, y_0 \in \mathbb{R}} and write {f(z) = u(x,y) + iv(x,y)} where {u,v: \mathbb{R}^{2} \rightarrow \mathbb{R}^{2}}. Then,

\displaystyle  \left[ \begin{array}{cc} u(x,y) \\ v(x,y) \end{array} \right] = \left[ \begin{array}{cc} u(x_0, y_0) \\ v(x_0, y_0) \end{array} \right] + \left[ \begin{array}{cc} {\rm Re}f^{\prime}(z_{0}) & -{\rm Im}f^{\prime}(z_{0}) \\ {\rm Im}f^{\prime}(z_{0}) & {\rm Re}f^{\prime}(z_{0}) \end{array} \right] \left[ \begin{array}{cc} x-x_{0} \\ y-y_{0} \end{array} \right] + o(\left |x-x_{0}\right | + \left |y-y_{0}\right |).

We first notice that this is stronger than the differentiability of the real map {(x, y) \mapsto (u(x,y), v(x,y))} in {\mathbb{R}^2 \rightarrow \mathbb{R}^2}. In the real, multivariable case, the derivative of this map is a linear operator, namely, the Jacobian, {J_{f}(x,y)}; in our equation above, the {2 \times 2} matrix on the right hand side is {J_{f}(x,y)}. Clearly, it is endowed with a distinct structure summarized in the following proposition.

Read the rest of this entry »