We consider a wide family of models for random constraint satisfaction problems. This family includes random k-SAT, random k-colourability
and many other well-studied generalizations. Our goal is to determine precisely which members of this family have sharp
thresholds of satisfiability, in the sense (formalized by Friedgut) that the probability of satisfiability drops suddenly
from 1-o(1) to o(1). In doing so, we want to understand what sorts of features can cause models to have coarse thresholds
rather than sharp ones. In this talk, I'll report some progress towards this goal.
This is joint work with Hamed Hatami.

Keywords:

Phase Transition;Computation;Reconstruction

Lecture #10864

Need help? Visit our help pages at http://www.msri.org/communications/vmath/hints

Streaming Video

This is a high quality streaming video encoded with MPEG-4 and with 640x480 resolution.

Windows and Mac users, QuickTime 6.5 or later required
Linux users, please see our Linux Help Page on how to view our streaming videos

Follow this link to --- Watch the Video Now Via Streaming Video ---

Download QuickTime File

You can download the QuickTime file here. Right click on the link and "Save As..." to save to your local computer.

• 10864-10864-QuickTime.mov (175 MB)

Create a DVD

You can download the video and audio files here. Please note that you need both files to create a DVD. Right click on the link and "Save As..." to save to your local computer. You can find instructions on how to create a DVD on our help page at http://www.msri.org/communications/vmath/author

• 10864-10864-DVD PCM Audio.aiff (273 MB - Audio Only)
• 10864-10864-MPEG-2 120min High Quality Encode.m2v (622 MB - Video Only)

Buy the DVD

If none of the options work for you, you can always buy the DVD of this lecture.

If you would like to purchase a copy of this video for $15+shipping, please Click Here!

See more of our Streaming Videos on our main VMath - Streaming Video page.