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

• Aran Raoufi (Geneva)
• Tuesday 02 May 2017, 16:15-17:15
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.