skip to main content
Caltech

LA Probability Forum

Thursday, October 6, 2022
5:00pm to 6:00pm
Add to Cal
Linde Hall 310
Percolation on finite transitive graphs
Philip Easo, Department of Mathematics, Caltech,

Tom Hutchcroft and I have been working to develop a general theory of percolation on arbitrary finite transitive graphs. This extends from percolation on local approximations to infinite graphs, such as a sequence of tori, to percolation on the complete graphs - the Erdős-Rényi model. I will summarise our progress on the basic questions: When is there a phase transition for the emergence of a giant cluster? When is the giant cluster unique? How does this relate to percolation on infinite graphs? I will then sketch our proof that for finite transitive graphs with uniformly bounded vertex degrees, the supercritical giant cluster is unique, verifying a conjecture of Benjamini from 2001.

For more information, please contact Math Dept by phone at 626-395-4335 or by email at [email protected].