How convenient!

It’s 07:00 in the morning. Having just gotten out of bed, you already poured yourself some breakfast cereal into the bowl, when you come to the most horrifying realization: you’re fresh out of milk. Beads of sweat start rolling down your forehead, and your heart starts beating like it’s trying to attract a sandworm on … More How convenient!

The useful Paley-Zygmund inequality

This is post #3 in the series about the “Useful Inequalities” cheat-sheet. Today’s inequality: The Paley-Zygmund inequality. A large portion of probability theory involves showing that random variables behave “nicely”, which often means “show that a random variable is not too far away from its mean”, or at least “show that is not too large”. … More The useful Paley-Zygmund inequality

The useful Chebyshev sum inequality

This is post #2 in the series about the “Useful Inequalities” cheat-sheet. Today’s useful inequality: Chebyshev’s sum inequality. Almost everyone I know is familiar with the famous Chebyshev’s inequality in probability theory, which states that most of the time, a random variable can’t be too far away from its mean: This inequality is very important … More The useful Chebyshev sum inequality

New app on Play Store: G(n,p) random graphs!

Seasoned readers of this blog already know the ins and outs of the Erdős–Rényi random graph model. They have probably read the introductory blogpost, have doodled and ruminated about them in class, and have dreamt about them frequently, if not constantly. But until now, they have not had the pleasure of sharing their fresh-from-the-oven random … More New app on Play Store: G(n,p) random graphs!

Random graphs: The duplicube graph + new paper on arXiv

Some mathematicians like probability, and some mathematicians like graphs, so it’s only natural that some mathematicians like probabilistic graphs. That is, they like to generate graphs at random, and then ask all sorts of questions about them: what are the features of a random graph? Will it be connected? Will it contain many triangles? Will … More Random graphs: The duplicube graph + new paper on arXiv

If you can be an animal, why can’t you be math?

Humans are animals (in the sense that they are members of the biological kingdom “Animalia”), but in English, they can be animals in a different sense: “John’s a chicken, he won’t dare say something against me” is quite clear to a native speaker. In Hebrew, by the way, saying that someone is “a chicken” makes … More If you can be an animal, why can’t you be math?

New paper on arXiv: Concentration on the Boolean hypercube via pathwise stochastic analysis

I’m happy to say that my advisor Ronen Eldan and I somewhat recently uploaded a paper to the arXiv under the title “Concentration on the Boolean hypercube via pathwise stochastic analysis” (https://arxiv.org/abs/1909.12067), wherein we prove inequalities on the Boolean hypercube using a cool continuous-time random process. In the previous post, I pretended that I had … More New paper on arXiv: Concentration on the Boolean hypercube via pathwise stochastic analysis

Catastrophic cubic crash course

I’m happy to say that my advisor Ronen Eldan and I somewhat recently uploaded a paper to the arXiv under the title “Concentration on the Boolean hypercube via pathwise stochastic analysis” (https://arxiv.org/abs/1909.12067), wherein we prove inequalities on the Boolean hypercube using a cool continuous-time random process. That’s quite a mouthful, I know, and quite unfortunately, … More Catastrophic cubic crash course