Applied maths 17.4: Maps and iteration
Systems that move in steps, x(n+1) = g(x(n)): fixed points, cobwebs, the stability test |g'| < 1, and the period-doubling route of the logistic map. Insects that breed once a year, a bank balance…
Guided, step-by-step lessons written by the community. Each one explains an idea, lets you guess, checks your answers and sums up.
Systems that move in steps, x(n+1) = g(x(n)): fixed points, cobwebs, the stability test |g'| < 1, and the period-doubling route of the logistic map. Insects that breed once a year, a bank balance…
Sustained oscillations of a fixed size: nullclines, limit cycles, the Hopf bifurcation, and why flows in the plane cannot be chaotic. Your heart beats with the same rhythm and strength whether you…
Follow fixed points as a parameter changes: saddle-node, transcritical and pitchfork bifurcations, critical harvests, epidemic thresholds and hysteresis. A fishery is harvested a little harder each…
Understand any one-variable system x' = f(x) from the graph of f: where it settles, how fast, and why it can never oscillate. A marble dropped into a bowl of honey never overshoots the bottom: it…
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…
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…
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…
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…
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…
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…
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…
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…
Fifteen questions across statistical modelling and machine learning, with new numbers on every attempt. Pass at 80 % to move on. This is where you find out what you can do without help. Each…
k-means groups unlabelled data into clusters; principal component analysis finds the few directions that carry most of the variation. A shop has a million customers and no labels. Which of them…
Gradient descent fits a model by walking downhill on its loss; a neural network is layers of simple units fitted that way. A language model has billions of numbers to fit, and no formula gives…
Decision trees split data into boxes by asking yes/no questions; random forests and boosting combine many trees into one strong model. The models that win most competitions on tables of data are…
Estimate test error without wasting data, choose models and tuning parameters honestly, and avoid data leakage. Many published models fail in the real world for one reason: somewhere, information…
Logistic regression turns a score into a probability; the confusion matrix, precision and recall say how good the classifier really is. A test for a rare disease that simply says 'healthy' to…
Ridge and lasso: penalise large coefficients to trade a little bias for a lot less variance. A model with 500 inputs fitted to 200 patients will happily find 'effects' that are pure noise…
Why the model that fits your data best is often the worst at predicting new data, and how test error splits into bias, variance and noise. With 10 data points, a polynomial of degree 9 passes…
Fourteen questions across optimisation, with new numbers on every attempt. Pass at 80 % to move on to unit 15. This is where you find out what you can do without help. Each question is new each…
Optimise with inequality constraints: active and inactive constraints, the Karush-Kuhn-Tucker conditions, and multipliers as prices. A factory may emit at most 50 tonnes of a pollutant; a portfolio…
Minimise a function by repeated steps downhill: gradient descent with a step size, and Newton's method using curvature. Every modern machine-learning model, from spam filters to language models, is…
Recognise convex sets and convex functions, test convexity with the second derivative, and see why convex problems are safe to optimise. Some optimisation problems with millions of variables are…