Event time:
Friday, February 24, 2012 - 9:00am to Thursday, February 23, 2012 - 7:00pm
Location:
206 LOM
Speaker:
Gil Kalai
Event description:
One of the earliest observation by Erdos and Renyi was that certain graph properties exhibit a sharp threshold behavior for random graphs when the edge probability increases. Similar phenomenon is important in the study of percolation. Discrete Fourier analysis and discrete isoperimetric results lead to very general explanation of the sharp threshold phenomena. I will describe some results and some open problems, including a highly provocative conjecture of Jeff Kahn and me regarding the location of the threshold.