Statistical reconstruction problems, minicourse notes
Course notes which I took for a minicourse given by Yuval Peres at the CRM in April 2018, in the context of a workshop on combinatorial statistics. The minicourse concerned various statistical reconstruction problems, namely: random coin tossing in a graphical environment, linear time solutions to the planted clique problem, reconstruction on trees, and trace reconstruction in the deletion channel.
Analytic combinatorics, talk
Slides for a presentation at the Computational Geometry Lab's weekly seminar in April 2015, at Carleton University. Analytic and symbolic combinatorics are powerful mathematical tools. In particular, they can be used relatively easily to quickly obtain asymptotic results for the count of objects with a given symbolic combinatorial description.
The Shannon capacity of graphs, talk
Slides for a presentation at the Computational Geometry Lab's weekly seminar in July 2014, at Carleton University. The Shannon capacity of a graph is an old information-theoretic graph parameter, relating to the amount of information which can be transferred losslessly through a noisy channel. This parameter conceals some remarkable mathematics.
Bounds on the obstacle number, talk
Slides for a presentation on the best known bounds on the obstacle number of a graph, given in October 2013 at the OCICS seminar at Carleton University. The obstacler number of a graph is the smallest number of obstacles with which the graph can be drawn with straight-line edges in the plane, such that no edge crosses an obstacle and every non-edge crosses an obstacle.
MATH 350: Graph theory and combinatorics, course notes
Course notes for MATH 350, as taught by Sergey Norin at McGill University in the Fall of 2012.