Here is a rough syllabus (precise schedule will depend on the progress in class, and suggestions/feedback are welcome).
The p-spin model and tensor PCA
Introduction
Replica method and replica symmetric calculation
One-step replica symmetry breaking
The expected number of critical points
synchronization and the Sherrington-Kirkpatrick model
Replica symmetric calculation and its inconsistency
Full replica symmetry breaking and its interpretation
Random overlap structures and the variational principle
Ultrametricity
The Hopfield model of associative memories
Replica solution
Intepretation and algorithms
The cavity method
Connection with message passing algorithms
Depending on time/interest might treat some of the followig
High-dimensional regression
Sparse PCA and the hidden submatrix problem
Models on sparse graphs
The stochastick block model
Random -satisfiability
Homeworks will be assigned on Friday, due on Friday of the following week.