About this course
Why does segregation emerge even when no one wants it? Why does an innovation suddenly
tip at a critical threshold? Why does a crowd of biased ordinary people, averaged, often
beat the smartest expert? These unrelated-looking questions share one answer: thinking
with many small models. This is a flagship build-it-yourself course — no slides to skim,
no conclusions to memorize. Every model is one you assemble in pure numpy, tune by dragging
parameters, and actually run in your own sandbox: you'll run Schelling's grid until it
self-segregates and watch mild preferences amplify into macro segregation; nudge percolation
density and watch a giant connected cluster appear at the critical point; drive the Solow
model to its steady state and see why saving alone can't sustain growth; converge a Markov
chain to its stationary distribution and prove the "the start doesn't matter" convergence
theorem; run replicator dynamics and pull apart the diversity prediction theorem —
crowd error = average individual error − diversity. The course follows Scott Page's Model
Thinking module skeleton, but every session is original hands-on teaching rebuilt for the
online sandbox: typeset formulas, diagrammed models, draggable parameters, code that really
runs. You leave not with "24 memorized models" but with the feel of many-model thinking —
facing a new problem, you know which model to reach for.
Syllabus
1Why Model · Segregation & Peer Effects3 sessions
2Aggregation & Decision Models3 sessions
3Modeling People & Linear Models2 sessions
4Tipping Points & Contagion2 sessions
5Economic Growth1 session
- 1Exponential Growth, the Basic Growth Model & the Solow Steady State30 minStart →
6Diversity, Innovation & Markov Processes2 sessions
7Lyapunov Functions & Path Dependence2 sessions
8Networks1 session
- 1Networks: Structure, Formation & Function30 minStart →
9Randomness, Games & Mechanism Design3 sessions
10Learning Dynamics & the Many-Model Thinker1 session
- 1Replicator Dynamics, Fisher's Theorem & the Diversity Prediction Theorem30 minStart →
Same series · 计算机科学与工程探索
CS & Engineering Explorations
Build from scratch the systems you usually treat as black boxes — and understand them to the core.
◎ Modeled on Princeton’s Bitcoin and Cryptocurrency Technologies + Nakamoto’s whitepaper
Blockchain & Bitcoin: From Hashes to Nakamoto Consensus, Build a Chain YourselfHash-pointer chains, Merkle proofs, PoW nonce search, the whitepaper's own attack probability — all in stdlib hashlib, offline and deterministicView course →