Student Probability Seminar

---

One-Line Proof of Rucinski CLT Theorem and More Using Stein's Method

Speaker: Dmytro Karabash

Location: Warren Weaver Hall 202

Date: Friday, February 18, 2011, 3:30 p.m.

Synopsis:

Many years ago Rucinski answered the question "When are small subgraphs of a random graph normally distributed?" in the 9-page paper of the same title. We will see a one-line proof of the result after introduction proper Stein's Method machinery and martingale decomposition. These methods go much beyond answering Rucinski Question.