skip to main content

Discrete Analysis Seminar

Tuesday, November 2, 2021
3:00pm to 4:00pm
Add to Cal
Linde Hall 187
Supercritical percolation on finite transitive graphs
Philip Easo, Department of Mathematics, Caltech,

In bond percolation, we build a random subgraph of a graph G by independently choosing to retain each edge with probability p. We call these retained edges "open" and the rest "closed". For many examples of G, when we increase the parameter p across a narrow critical window, the subgraph of open edges undergoes a phase transition: with high probability, below the window, it contains no giant components, whereas above the window, it contains at least one giant component. Now take G to be a large, finite, connected, transitive graph with bounded vertex degrees. We prove that above the window, there is exactly one giant component with high probability. This was conjectured to hold by Benjamini in 2001 but was previously only known for large torii and expanders, using methods specific to those cases.

The work that I will describe is joint with Tom Hutchcroft

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