Tag Archives: Percolation

Analysis of Boolean Functions week 5 and 6

Posted on October 7, 2013 by

Lecture 7 First passage percolation 1)  Models of percolation. We talked about percolation introduced by Broadbent and Hammersley in 1957. The basic model is a model of random subgraphs of a grid in n-dimensional space. (Other graphs were considered later as … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching | Tagged , | Leave a comment

Noise Sensitivity and Percolation. Lecture Notes by Christophe Garban and Jeff Steif

Posted on November 6, 2011 by

Lectures on noise sensitivity and percolation is a new beautiful monograph by Christophe Garban and Jeff Steif. (Some related posts on this blog: 1, 2, 3, 4, 5)

Posted in Combinatorics, Probability | Tagged , , , , | Leave a comment

A Problem on Planar Percolation

Posted on April 25, 2009 by

Conjecture (Gady Kozma):  Prove that the critical probability for planar percolation on a Cayley graph of the group is always an algebraic number. Gady  mentioned this conjecture in his talk here about percolation on infinite Cayley graphs.  (Update April 30: Today Gady mentioned … Continue reading →

Posted in Open problems, Probability | Tagged , | 1 Comment

Noise Sensitivity Lecture and Tales

Posted on March 6, 2009 by

  A lecture about Noise sensitivity Several of my recent research projects are related to noise, and noise was also a topic of a recent somewhat philosophical post.   My oldest and perhaps most respectable noise-related project was the work with Itai Benjamini and Oded … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Probability | Tagged , , , , , , | 12 Comments