University of Cambridge > Talks.cam > Probability > Supercritical Percolation on Finite Transitive Graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Supercritical Percolation on Finite Transitive Graphs

Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi .

Consider a large, finite graph. In bond percolation, each edge is independently set to “open” with probability p. In many cases, 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, there are no giant components, whereas above the window, there is at least one giant component. We prove that for transitive graphs above the window, there is exactly one giant component, with high probability. This was conjectured to hold by Benjamini, but was only known for large tori and expanders, using methods specific to those cases.

The work that I will describe is joint with Tom Hutchcroft.

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

FW 11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon The Talking Point at The Technology Partnership, Melbourn Science Park, Melbourn, SG8 6EE Average on weekdays: 8896.42088608 kWh

Other talks

How bubble acoustics can help in three apocalypses Title TBC How Far Can Good Go Without God? The Limits of a Naturalistic Ethic Group Presentation 4 Title TBC Polar Oceans Seminar Talk
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity