Title: Percolation on Graphs
Speaker: Andrew Lohr, Rutgers University
Date: Wednesday, April 6, 2016 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
Suppose you have a d-dimensional infinite lattice (V=Z^d and edges between any two points distance 1 apart), and remove edges from it independently with some fixed probability. Then, we will be interested in the connected components you are probably left with. We say that the graph percolates if you have an infinite connected component left over. We'll go over some of the easier results, and maybe mention some open related problems.