University of Cambridge > Talks.cam > Trinity Mathematical Society > Percolation and Random Walks

  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

Percolation and Random Walks

Download to your calendar using vCal

If you have a question about this talk, please contact Michelle Sweering .

Consider the two dimensional lattice and keep every edge with probability p, independently over different edges. It is known that there exists a critical probability p_c so that for all p > p_c there exists a unique infinite connected component. But how well connected is this infinite cluster? One way to evaluate this is by examining the rate of spread of a simple random walk on the cluster.

This talk is part of the Trinity Mathematical Society series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & LT2, Computer Laboratory, William Gates Building. Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3 Wolfson Research Event

Other talks

Trigger-Level Analysis at ATLAS Coming soon CSAR lecture: Beyond Net Zero: Can We Repair The Climate? Talk TBC Loke CTR Annual Meeting 2026 - Epigenetics of embryogenesis and placentation Title to be confirmed
 

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