EdusalsaDiscover Your Stanford


Random Processes on Graphs and Lattices

  • Not Offered

3 units

Letter or Credit/No Credit

Covering modern topics in the study of random processes on graphs and lattices. Specifically, a subset of: Random walks, electrical networks and flows. Uniform spanning trees. Percolation and self-avoiding walks. Contact process, voter model and the exclusion process. Ising, Potts, and Random-Cluster model. Random graphs. Prerequisites: MATH 115 (or equivalent), STAT 217 (or equivalent).

Course Prequisites

STATS 221 is useful for

Sign Up

To save STATS 221 to your course bucketlist

Already Have An Account? Log In