Recent Comments

Recent Posts
 High Dimensional Combinatorics at the IIAS – Program Starts this Week; My course on Hellytype theorems; A workshop in Sde Boker
 Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
 Ladies and Gentlemen, Stan Wagon: TYI 32 – A Cake Problem.
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 Sergiu Hart: TwoVote or not to Vote
 A toast to Alistair: Two Minutes on Two Great Professional Surprises
 TYI 31 – Rados Radoicic’s Rope Problem
 Eran Nevo: gconjecture part 4, Generalizations and Special Cases
 The World of Michael Burt: When Architecture, Mathematics, and Art meet.
Top Posts & Pages
 Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
 High Dimensional Combinatorics at the IIAS  Program Starts this Week; My course on Hellytype theorems; A workshop in Sde Boker
 Ladies and Gentlemen, Stan Wagon: TYI 32  A Cake Problem.
 TYI 30: Expected number of Dice throws
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 The Race to Quantum Technologies and Quantum Computers (Useful Links)
 Why Quantum Computers Cannot Work: The Movie!
RSS
Category Archives: Probability
Analysis of Boolean Functions week 5 and 6
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 ndimensional space. (Other graphs were considered later as … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Arrow's theorem, Percolation
Leave a comment
Analysis of Boolean Functions – Week 3
Lecture 4 In the third week we moved directly to the course’s “punchline” – the use of FourierWalsh expansion of Boolean functions and the use of Hypercontractivity. Before that we started with a very nice discrete isoperimetric question on a … Continue reading
Analysis of Boolean functions – week 2
Post on week 1; home page of the course analysis of Boolean functions Lecture II: We discussed two important examples that were introduced by BenOr and Linial: Recursive majority and tribes. Recursive majority (RM): is a Boolean function with variables … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability, Teaching
Tagged Boolean functions, Tribes
Leave a comment
Poznań: Random Structures and Algorithms 2013
Michal Karonski (left) who built Poland’s probabilistic combinatorics group at Poznań, and a sculpture honoring the Polish mathematicians who first broke the Enigma machine (right, with David Conlon, picture taken by Jacob Fox). Update: Here is a picture from 2015, while … Continue reading
Posted in Combinatorics, Conferences, Open problems, Philosophy, Probability
Tagged Poznan, RSA
2 Comments
BosonSampling and (BKS) Noise Sensitivity
Update (Nov 2014): Noise sensitivity of BosonSampling and computational complexity of noisy BosonSampling are studied in this paper by Guy Kindler and me. Some of my predictions from this post turned out to be false. In particular the noisy BosonSampling … Continue reading
Posted in Computer Science and Optimization, Physics, Probability, Quantum
Tagged BosonSampling, Noise, Noisesensitivity, Quantum computation
8 Comments
LawlerKozdronRichardsStroock’s combined Proof for the MatrixTree theorem and Wilson’s Theorem
David Wilson and a cover of Shlomo’s recent book “Curvature in mathematics and physics” A few weeks ago, in David Kazhdan’s basic notion seminar, Shlomo Sternberg gave a lovely presentation Kirchhoff and Wilson via Kozdron and Stroock. The lecture is based on … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Probability
Tagged David Wilson, Gustav Kirchhoff, Trees
4 Comments
Oz’ Balls Problem: The Solution
A commentator named Oz proposed the following question: You have a box with n red balls and n blue balls. You take out each time a ball at random but, if the ball was red, you put it back in the box and take out … Continue reading
Posted in Probability, Test your intuition
Tagged Erosion, J. F. C. Kingman, Probability, S. E. Volkov
1 Comment
Taking balls away: Oz’ Version
This post is based on a comment by Oz to our question about balls with two colors: “There is an interesting (and more difficult) variation I once heard but can’t recall where: You have a box with n red balls … Continue reading
Posted in Guest blogger, Probability, Test your intuition
Tagged Oz, Probability, Test your intuition
14 Comments
Answer to test your intuition (18)
You have a box with n red balls and n blue balls. You take out balls one by one at random until left only with balls of the same color. How many balls will be left (as a function of n)? … Continue reading
Posted in Probability, Test your intuition
Tagged Itai Benjamini, Probability, random permutation, Ronen Eldan, Test your intuition
3 Comments
Itai Ashlagi, Yashodhan Kanoria, and Jacob Leshno: What a Difference an Additional Man makes?
We are considering the stable marriage theorem. Suppose that there are n men and n women. If the preferences are random and men are proposing, what is the likely average women’s rank of their husbands, and what is the likely average … Continue reading