Talks

  • Talk on KKL theorem. Here is the talk script.
    • This is a small talk I made in the CS department for the course CS 496, computation complexity. I introduced noise operator, noise stability, attenuated influence and finally proved the KKL theorem.
  • Introduction to random matrix theory (series). Fall 2019, Northwestern University. (You can get the class notes here.)
  • Schaeffer bijection and scaling limit of space of quadrangulation. June 14, 2019. Northwestern University Probability Seminar.
    • Abstract: In 1993, Aldous proved that when properly encoded, a random tree will behave like Brownian motion, as the size of the vertex set tends to infinity. We will introduce Schaeffer’s bijection, which gives a one-to-one correspondence between well labeled trees and quadrangulations. As a result, the space of quadrangulations, when equipped with a scaled graph distance, will tend to a limiting metric space in Gromov-Hausdorff sense, known as the Brownian map.

Teaching