Nick Harvey

Abstract: This talk discusses algorithms to solve systems of linear equations where the matrix is the Laplacian matrix of a graph. These systems arise in many applications: in scientific computing, when using the finite difference method to...

Discrepancy theory has been an important research area in combinatorics and geometry for several decades. Recently there has been a lot of activity in discrepancy theory, in two directions. The first is efficient algorithmic proofs for classical...

The Lovasz Local Lemma (LLL) is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events. Finding...

The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the...