- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
- Influence, Threshold, and Noise
- Erdős Lectures 2014 – Dan Spielman
- Answer to Test Your Intuition (22)
- Test your intuition (22): Selling Two Items in a Bundle.
Top Posts & Pages
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Believing that the Earth is Round When it Matters
- Why Quantum Computers Cannot Work: The Movie!
- Polymath 8 - a Success!
- Navier-Stokes Fluid Computers
- Another Forgotten Bet: Is Don Zagier About to Owe Me 1000 Shekels For The Proof of the ABC Conjecture?
- The Ultimate Riddle
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Five Open Problems Regarding Convex Polytopes
Tag Archives: Percolation
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
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)
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
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