Stochastic Processes on Graphs
Download as PDF
Course Description
Local weak convergence, Gibbs measures on trees, cavity method, and replica symmetry breaking. Examples include random k-satisfiability, the assignment problem, spin glasses, and neural networks. Prerequisite: 310A or equivalent. https://web.stanford.edu/~montanar/TEACHING/Stat316/stat316.html
Grading Basis
ROP - Letter or Credit/No Credit
Min
1
Max
3
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
Programs
STATS316
is a
completion requirement
for:
- (from the following course set: )
- (from the following course set: )
- (from the following course set: )
- (from the following course set: )