ConceptAI & ML
Stationary distribution
A probability distribution over the state space that remains unchanged after one step of the Markov chain transition.
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.
Markov chain5Probability distribution4Eigenvalues and eigenvectors2Probability vector2Transition matrix2Dynamical system1Invariant distribution1Markov chains or dynamical systems1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
6Each in their own terms, from the easiest level.
Joe Blitzstein
A probability vector S for a Markov chain such that multiplying it by the transition matrix Q yields the same vector S.Russ Tedrake
A probability distribution that remains unchanged over time in a Markov process.Pieter Abbeel
The distribution we end up with in a Markov chain whose influence from the initial distribution becomes independent of how you started out.Sergey Levine
A distribution that remains unchanged after the application of the state-action transition operator.Ryan O'Donnell
A probability distribution on vertices that is invariant under the transition probabilities of a Markov chain.
Lectures that assume it
10- Spectral Graph Theory: Minimizing and Maximizing the Quadratic Form
- Markov Chains Continued Further (Statistics 110, Lecture 33)
- Spectral Graph Theory: Linear Algebra and Irregular Graphs
- Spectral Graph Theory III: Eigenvalues of the Laplacian
- Privacy Amplification for Correlated-Noise Mechanisms via b-Min-Sep Subsampling
- Spectral Graph Theory III: Mixing Time
- Dinur's Proof of the PCP Theorem: The Powering Step
- Policy Gradient Methods
- Offline Reinforcement Learning
- Signatures of Irreversibility in Microscopic Models of Flocking
Connections
27The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Markov chain
- Probability distribution
- Eigenvalues and eigenvectors
- Transition matrix
- Consistency condition
- Expander mixing lemma
Show 3 moreShow fewer
Lectures18
- Markov Chains Continued: Irreducibility, Recurrence, Transience, and Reversibility (Statistics 110, Lecture 32)
- Stochastic Processes I
- Hidden Markov Models
- Markov Chains
- Policy Gradient Foundations: Trajectory Distributions & High-Dimensional State Spaces
- Spectral Graph Theory: The Markov Transition Operator
Show 12 moreShow fewer
- Stochastic dynamics
- Stochastic Control
- Spectral Graph Theory: Minimizing and Maximizing the Quadratic Form
- Markov Chains Continued Further (Statistics 110, Lecture 33)
- Spectral Graph Theory: Linear Algebra and Irregular Graphs
- Spectral Graph Theory III: Eigenvalues of the Laplacian
- Privacy Amplification for Correlated-Noise Mechanisms via b-Min-Sep Subsampling
- Spectral Graph Theory III: Mixing Time
- Dinur's Proof of the PCP Theorem: The Powering Step
- Policy Gradient Methods
- Offline Reinforcement Learning
- Signatures of Irreversibility in Microscopic Models of Flocking