Probabilistic techniques: Tutorial

Welcome to the website to the tutorial class of Probabilistic techniques (lecturer Martin Tancer). The tutorials are yet to be scheduled. See the plan for tutorial contents below.

The tutorial classes are co-taught with Tomáš Hons. The plan is that I cover the first half of tutorials and he does the second half.

If you have a feeling that

write me (tung@iuuk.mff.cuni.cz) or Tomáš (honst@iuuk.mff.cuni.cz) an email before it's too late.

How to obtain credit?

You will get credit for solving homework. We use the Postal Owl system for publishing, submitting, and grading homework.

Collaboration is discouraged since you can pass the whole course by just doing tutorial classes. But we have no way of checking that.

Using computer algebra systems is fully allowed and encouraged in your solutions. Ideally, please send a link/certificate in the complexity sense to how you used it for solving the problem. So e.g. a Wolfram alpha URL that includes your expression.

Schedule

Below is the (tentative) schedule of the tutorial classes.

Date Tutorial Tutorial content Homework set announcement Hints published Homework deadline
Yes (by Tung) Basic probabilistic method (the way our lord Pál Erdős envisioned it) Set 1
No
Yes (by Tung) Expectation and method of alterations Set 2 Set 1
Yes (by Tung) Presenting solutions of Set 1 Set 1
No Set 2
Yes (by Tung) Presenting solutions of Set 2 Set 2
Yes (by Tung) Markov's and Chebyshev's inequality Set 3
No
Yes (by Tomáš) Lovász local lemma. Chernoff bounds. Set 4 Set 3
Yes (by Tomáš) Presenting solutions of Set 3 Set 3
Yes (by Tomáš) Markov chains. Balls & bins. Set 5 (practically no deadline) Set 4
No Set 4
Yes (by Tomáš) Presenting solutions of Set 4 Set 5