ConceptEngineering
Hit-and-run algorithm
A randomized Markov chain method used to generate uniform samples in a convex set by picking random directions and line intersections.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.