Markets: A Rigorous Course

Learning outcomes

Foundation about 5 min

After this module you can:

  1. Express any trading system's results in R-multiples, compute its expectancy and System Quality Number, state what the SQN does and does not prove, and compute how many trades are needed to distinguish an edge from noise ((3.2a)–(3.2b)).
  2. Derive the Kelly fraction f∗=p−q/bf^* = p - q/b by maximising expected log wealth, prove that it maximises the almost-sure asymptotic growth rate, and prove that for even-money bets any f≥2f∗f \ge 2f^* gives negative growth.
  3. Derive the continuous-time Kelly fraction f∗=(μ−r)/σ2f^* = (\mu - r)/\sigma^2 and growth rate g(f)=r+f(μ−r)−f2σ2/2g(f) = r + f(\mu - r) - f^2\sigma^2/2, and its multi-asset form f∗=Σ−1(μ−r1)f^* = \Sigma^{-1}(\mu - r\mathbf 1).
  4. Prove that betting cc times Kelly yields 2c−c22c - c^2 of the maximal excess growth with cc times the volatility, and that the probability of ever losing to a fraction xx of wealth is x2/c−1x^{2/c - 1}.
  5. Quantify how estimation error in μ\mu reduces realised growth and derive the optimal shrinkage t2/(1+t2)t^2/(1+t^2) of the estimated Kelly fraction.
  6. Derive the gambler's-ruin probability by a difference equation and by optional stopping, and bound the probability of a given loss under fixed-fractional betting by xθx^\theta with θ\theta the Lundberg exponent.
  7. Compute drawdown probabilities for Brownian log-wealth and simulate maximum-drawdown distributions for a trade list.
  8. Size a position in shares or lots from a risk budget and a stop, and explain how gaps, correlation and estimation error modify the answer.

Create a free account

Reading is open to everyone. An account keeps your progress, answers, notes and code drafts, and gives you the study plan, the journals and the simulator. Running code needs an account approved for it.