Random Processes on Graphs and Lattices
Download as PDF
Course 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).
Grading Basis
ROP - Letter or Credit/No Credit
Min
3
Max
3
Course Repeatable for Degree Credit?
No
Course Component
Lecture
Enrollment Optional?
No
Does this course satisfy the University Language Requirement?
No
Programs
STATS221
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: )
- (from the following course set: )
- (from the following course set: )