University of Cambridge > Talks.cam > Probability > A reduction of the theta(pc) problem to a correlation inequality.

  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

A reduction of the theta(pc) problem to a correlation inequality.

Download to your calendar using vCal

  • UserGady Kozma (Weizmann Institute)
  • ClockTuesday 12 November 2024, 15:00-16:00
  • HouseMR12.

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

We conjecture an inequality for percolation probabilities and prove it in some special cases. This inequality, if true, would imply that there is no percolation at criticality for all dimensions. Joint work with Shahaf Nitzan.

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

Quantum condensate seminars Gonville and Caius College, Junior Parlour Cambridge Judge Business School, W2.01

Other talks

Title to be confirmed Title TBC Fairy Tales Coming soon Caribbean Trip and Cacti Title TBC
 

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