Ramanujan Graphs and Interlacing Families

Date Topic Presenter Info
Mar 17, 2017 “Interlacing Families 1: Bipartite Ramanujan Graphs of All Degrees” (2013) by Adam Marcus, Daniel Spielman, and Nikhil Srivastava Maxwell Levit Ramanujan Graphs, 2-lifts, spectral expansions and graph expansions will be defined. We will see Theorems of Heilmann and Lieb and Theorems of Godsil on matching polynomials
Mar 24, 2017 “Interlacing Families 1: Bipartite Ramanujan Graphs of All Degrees” (2013) by Adam Marcus, Daniel Spielman, and Nikhil Srivastava Leanne Stuive We will see core results on interlacing polynomials and stable polynomials
Mar 31, 2017 “Twice-Ramanujan Sparsifies” (2014) by Joshua Batson, Daniel Spielman, and Nikhil Srivastava Mehdi Karimi (1) Barrier Function argument talk: Graph Sparsification 2: Barrier Functions and Rank-one Updates by Nikhil Srivastava (2) Two further talks by Nikhil Srivastava: Graph Sparsification 1: Sparsification via Effective Resistances and Graph Sparsification 3: Interlacing Polynomials and Ramanujan Graphs of Every Degree (3) Blog Posts of Nikhil Srivastava: for example, Discrepancy, Graphs and the Kadison-Singer Problem
Apr 7, 2017 “Interlacing Families 2: Mixed Characteristic Polynomials and the Kadison-Singer Problem” (2013) by Adam Marcus, Daniel Spielman, and Nikhil Srivastava David Wagner An overview of results and applications
Apr 14, 2017 Good Friday. This Friday we have no talks.
Apr 21, 2017 Question Session. We discuss questions related to the topics of this term
Previous
Next