Current students

Subscribe to Current students
Thursday, April 18, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Akshay Ramachandran

Title: Graph Sparsification by Effective Resistances

Speaker: Akshay Ramachandran
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

We will discuss an application of the matrix concentration inequalities of Tropp to spectral sparsification of graphs.

Thursday, April 11, 2019 1:30 pm - 1:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Chris Godsil

Title: Erdös-Rényi Graphs

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

These might not be the Erdös-Rényi graphs you first thought of. Let V be a 3-dimensional vector space over a field of odd order q.

Thursday, April 11, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Steve Vavasis

Title: Optimal detection of sparse principal components in high dimension

Speaker: Steve Vavasis
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

I will present the paper with this title by Berthet and Rigollet (Ann. Stat., 41 (2013) 1780-1815, https://projecteuclid.org/download/pdfview_1/euclid.aos/1378386239). 

Friday, April 5, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Maryam Fazel

Title: Online Competitive Algorithms for Resource Allocation

Speaker: Maryam Fazel
Affiliation: University of Washington
Room: MC 5501

Abstract:

In online optimization with budgets, the data in the optimization problem is revealed over time. At each step a decision variable needs to be set without knowing the future inputs, while there is a budget constraint that couples the decisions across time.

Thursday, April 4, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Sina Baghal

Title: High dimensional probability: Estimation in high dimensions

Speaker: Sina Baghal
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

In this talk, we discuss high dimensional estimation problems. The aim is to estimate some point x in a given ambient bounded space K using a small number of independent random observations.

Wednesday, April 3, 2019 4:30 pm - 4:30 pm EDT (GMT -04:00)

PMath/C&O Joint Colloquium - Ben Moore

Title: A proof of the Hell-Nešetřil Dichotomy via Siggers Polymorphisms

Speaker: Ben Moore
Affiliation: University of Waterloo
Room: MC 4020

Abstract:

In 2017, the constraint satisfaction dichotomy was proven via techniques from universal algebra. If we restrict this theorem to graphs, we get the Hell-Nešetřil Dichotomy, which is a statement about colouring graphs.

Thursday, March 28, 2019 1:30 pm - 1:30 pm EDT (GMT -04:00)

Algebraic Graph Theory - Chris Godsil

Title: Not colouring the 3-sphere

Speaker: Chris Godsil
Affiliation: Unioversity of Waterloo
Room: MC 6486

Abstract:

Let S(3) be the graph formed by the unit vectors in R3, two vectors adjacent if they are orthogonal. I will prove that S(3) has no 3-colouring.

Tuesday, March 26, 2019 2:00 pm - 2:00 pm EDT (GMT -04:00)

Reading Group on Entropy and Counting - John Schanck

Title: On the average size of independent sets in triangle-free graphs

Speaker: John Schanck
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Some of the results that we've seen in this reading group have been improved recently using the "hard-core model" from statistical physics.

Thursday, March 28, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Jimit Majmudar

Title: High-dimensional probability: Bernstein's Inequality

Speaker: Jimit Majmudar
Affiliation: University of waterloo
Room: MC 5417

Abstract:

We will extend our study of concentration inequalities so far to random matrices.