ConceptEconomics
Random walk
A mathematical formalization of a path that consists of a succession of random steps on some mathematical space.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Chance processes1Efficient markets hypothesis1Expected value1Probability1Probability distribution1Probability theory1Spatial constraints1Standard deviation1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Joe Blitzstein
A mathematical formalization of a path that consists of a succession of random steps on a graph or number line.David Bashwiner
A path resulting from a series of chance processes determining which direction to move at any given time, constrained by the type of space the object is in.Robert Shiller
A process where stock prices are efficient and any change from day to day is due only to unpredictable news, making future movements unpredictable.
Lectures that assume it
15The first 12 are shown.
- Markov Chains Continued Further (Statistics 110, Lecture 33)
- Spectral Graph Theory: Conductance and Sparsest-Cut
- Expander Graph Application 2: Derandomization
- Exchanges, Brokers, Dealers, Clearinghouses
- Spectral Graph Theory: The Standard Random Walk
- ER Toward Typical EPR
- Progress on Zeta and L-Functions Motivated by the Riemann Hypothesis
- Time Series Analysis III
- What We Still Don’t Know About Critical Percolation
- Spectral Graph Theory: The Markov Transition Operator
- The Sum-of-Squares (SOS) Proof System
- Spectral Graph Theory Beyond the Standard Graph Laplacian
Connections
28The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Efficient markets hypothesis
- Expected value
- Probability
- Probability distribution
- Gambler's ruin
- Conductance
Show 3 moreShow fewer
Lectures19
- Random Walks
- Gambler's Ruin and Random Variables
- The Art of Melody
- Efficient Markets
- Markov Chains Continued Further (Statistics 110, Lecture 33)
- Spectral Graph Theory: Conductance and Sparsest-Cut
Show 13 moreShow fewer
- Expander Graph Application 2: Derandomization
- Exchanges, Brokers, Dealers, Clearinghouses
- Spectral Graph Theory: The Standard Random Walk
- ER Toward Typical EPR
- Progress on Zeta and L-Functions Motivated by the Riemann Hypothesis
- Time Series Analysis III
- What We Still Don’t Know About Critical Percolation
- Spectral Graph Theory: The Markov Transition Operator
- The Sum-of-Squares (SOS) Proof System
- Spectral Graph Theory Beyond the Standard Graph Laplacian
- Time Series Analysis I
- Mathematical Aspects of Turbulence
- The Mathematics of Crime: Predictive Policing and Gang Activity