University of Cambridge > Talks.cam > Probability > Sharpness of the phase transition for random-cluster and Potts model via decision trees

Sharpness of the phase transition for random-cluster and Potts model via decision trees

Add to your list(s) Download to your calendar using vCal

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

We prove that the phase transition of random-cluster and Potts models on any transitive graph is sharp. That is, we show that for $p < p_c$, the probability that the origin is connected by an open path to distance $n$ decays exponentially fast in $n$. This would also imply the sharpness of phase transition for the Potts model. A main ingredient of the proof comes from the theory of decision trees. An inequality on decision trees on monotonic measures is obtained which generalises the OSSS inequality on product spaces. This talk is based on works with H. Duminil-Copin and V. Tassion.

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.

 

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