Applied maths 16.1: Markov chains
Model a system that hops between states at random: transition probabilities, predictions a few steps ahead, the long-run share of time in each state, and how long a state lasts. A factory machineโฆ
9 posts match
Model a system that hops between states at random: transition probabilities, predictions a few steps ahead, the long-run share of time in each state, and how long a state lasts. A factory machineโฆ
Model random arrivals in time: counts in an interval, waiting times, the memoryless property, and merging streams of arrivals. Calls to a help desk, insurance claims, radioactive decays and websiteโฆ
Add up many random steps: the mean and spread of a random walk, the square-root law, and Brownian motion with drift as the continuous version. A pollen grain in water jiggles because millions ofโฆ
Differentiate functions of Brownian motion with Itรด's lemma, and use it on geometric Brownian motion, the standard model of share prices. For Brownian motion $W$, the average of $W(t)$ is 0 for allโฆ
Price options by replication: payoffs, the one-step binomial tree and risk-neutral probabilities, the Black-Scholes formula, and put-call parity. An airline wants protection if fuel becomesโฆ
Estimate averages, probabilities and prices by simulation: the estimate, its standard error, the number of runs needed, and a simple way to need fewer. Banks price exotic options on fifty shares atโฆ
Measure and forecast how much prices move: log returns, historical volatility, EWMA and GARCH updates, long-run volatility, and implied volatility. Black-Scholes assumes volatility is constantโฆ
Fifteen questions across stochastic processes and financial mathematics, with new numbers on every attempt. Pass at 80 % to move on to unit 17. This is where you find out what you can do withoutโฆ
Maxwell's equations in words, why light is an electromagnetic wave, and what happens when wires become transmission lines. In 1865 Maxwell wrote down four equations for electricity and magnetismโฆ