Random Processes on Graphs and Lattices

Catalog description

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).