MATH 777
Stochastic Processes
(Fall 2003)
Instructor:
Jason Schweinsberg
Meeting
Time & Room
In this course, we will study discrete probability on infinite
graphs. We will focus primarily on the case in which the graph is a tree.
Topics covered in the course will include the connections between random
walks on graphs and electrical networks, Galton-Watson trees, percolation
on trees, and random spanning trees and forests. Most of the material
for the course will come from the book Probability on Trees and Networks
by Russell Lyons with Yuval Peres. A draft of the book is available at
http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html.
Prerequisites: MATH 671 and MATH 672, or permission
of the instructor.
Last modified:
August 13, 2003
|
