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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Newnham College Speaker Series Gift Ideas Type the title of a new list here

Other talks

ANOVA of balanced multi-factorial designs: between subject designs, and single subject studies Neural Network Verification as a Programming Language Challenge Topological modular forms and bilinear forms Cambridge RNA Club - IN PERSON Repeated Measures and Mixed Model ANOVA TBA
 

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