Seminars and Colloquia by Series

Everything Alexander in the context of mapping class group

Series
Geometry Topology Student Seminar
Time
Wednesday, November 30, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jaden WangGeorgia Tech

Disks are nice for many reasons. In this casual talk, I will try to convince you that it's even nicer than you think by presenting the Alexander's lemma. Just like in algebraic topology, we are going to rely on disks heavily to understand mapping class groups of surfaces. The particular method is called the Alexander's method. Twice the Alexander, twice the fun! No background in mapping class group is required.

Anticoncentration in Ramsey graphs and a proof of the Erdos-McKay conjecture

Series
Graph Theory Seminar
Time
Tuesday, November 29, 2022 - 15:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Mehtaab SawhneyMassachusetts Institute of Technology

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog n (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge-statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of "random-like’’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.

The proof proceeds via an "additive structure’’ dichotomy on the degree sequence, and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics, and low-rank approximation. One of the consequences of our result is the resolution of an old conjecture of Erdos and McKay, for which he offered one of his notorious monetary prizes.
(Joint work with Matthew Kwan, Ashwin Sah and Lisa Sauermann)

A Nonlocal Gradient for High-Dimensional Black-Box Optimization in Scientific Applications

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 28, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/98355006347
Speaker
Guannan ZhangOak Ridge National Laboratory (ORNL)

In this talk, we consider the problem of minimizing multi-modal loss functions with many local optima. Since the local gradient points to the direction of the steepest slope in an infinitesimal neighborhood, an optimizer guided by the local gradient is often trapped in a local minimum. To address this issue, we develop a novel nonlocal gradient to skip small local minima by capturing major structures of the loss's landscape in black-box optimization. The nonlocal gradient is defined by a directional Gaussian smoothing (DGS) approach. The key idea is to conducts 1D long-range exploration with a large smoothing radius along orthogonal directions, each of which defines a nonlocal directional derivative as a 1D integral. Such long-range exploration enables the nonlocal gradient to skip small local minima. We use the Gauss-Hermite quadrature rule to approximate the d 1D integrals to obtain an accurate estimator. We also provide theoretical analysis on the convergence of the method on nonconvex landscape. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by a highly oscillating, deterministic noise. We provide a convergence theory under which the iterates converge to a tightened neighborhood of the solution, whose size is characterized by the noise frequency. We complement our theoretical analysis with numerical experiments to illustrate the performance of this approach.

Intersection number and intersection points of closed geodesics on hyperbolic surfaces by Tina Torkaman

Series
Geometry Topology Seminar
Time
Monday, November 28, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Speaker
Tina TorkamanHarvard University

 In this talk, I will talk about the (geometric) intersection number between closed geodesics on finite volume hyperbolic surfaces. Specifically, I will discuss the optimum upper bound on the intersection number in terms of the product of hyperbolic lengths. I also talk about the equidistribution of the intersection points between closed geodesics.

Lattices on shuffle words

Series
Algebra Seminar
Time
Monday, November 28, 2022 - 13:30 for 1 hour (actually 50 minutes)
Location
Clough 125 Classroom
Speaker
Thomas McConvilleKennesaw State University

The shuffle lattice is a partial order on words determined by two common types of genetic mutation: insertion and deletion. Curtis Greene discovered many remarkable enumerative properties of this lattice that are inexplicably connected to Jacobi polynomials. In this talk, I will introduce an alternate poset called the bubble lattice. This poset is obtained from the shuffle lattice by including transpositions. Using the structural relationship between bubbling and shuffling, we provide insight into Greene’s enumerative results. This talk is based on joint work with Henri Mülle. 

Optimal variance-reduced stochastic approximation in Banach spaces

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 21, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005 and https://gatech.zoom.us/j/98355006347
Speaker
Wenlong MouUC Berkeley

Please Note: Speaker will give the talk in person

Estimating the fixed-point of a contractive operator from empirical data is a fundamental computational and statistical task. In many practical applications including dynamic programming, the relevant norm is not induced by an inner product structure, which hinders existing techniques for analysis. In this talk, I will present recent advances in stochastic approximation methods for fixed-point equations in Banach spaces. Among other results, we discuss a novel variance-reduced stochastic approximation scheme, and establish its non-asymptotic error bounds. In contrast to worst-case guarantees, our bounds are instance-dependent, and achieve the optimal covariance structure in central limit theorems non-asymptotically.
Joint works with Koulik Khamaru, Martin Wainwright, Peter Bartlett, and Michael Jordan.

Naturality of Legendrian LOSS invariant under positive contact surgery

Series
Geometry Topology Seminar
Time
Monday, November 21, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Shunyu WanUniversity of Virginia

Given a Legendrian knot L in a contact 3 manifold, one can associate a so-called LOSS invariant to L which lives in the knot Floer homology group. We proved that the LOSS invariant is natural under the positive contact surgery. In this talk I will review some background and definition, try to get the ideal of the proof and talk about the application which is about distinguishing Legendrian and Transverse knot.

Algebraic and combinatorial problems arising from maximum likelihood estimation using small datasets

Series
Algebra Seminar
Time
Monday, November 21, 2022 - 13:30 for 1 hour (actually 50 minutes)
Location
Clough 125 Classroom
Speaker
Daniel Irving BernsteinTulane University Department of Mathematics

Loosely speaking, the maximum likelihood threshold of a statistical model is the fewest number of data points needed to fit the model using maximum likelihood estimation. In this talk, I will discuss combinatorial and algebraic-geometric approaches to studying this poorly understood quantity for a certain class of Gaussian models. This is based on joint work with Sean Dewar, Steven Gortler, Tony Nixon, Meera Sitharam, and Louis Theran

Structure and computation of data-driven brain networks

Series
Time
Friday, November 18, 2022 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 005 and Online
Speaker
Hannah ChoiGeorgia Tech

https://gatech.zoom.us/j/95197085752?pwd=WmtJUVdvM1l6aUJBbHNJWTVKcVdmdz09

The complex connectivity structure unique to the brain network is believed to underlie its robust and efficient coding capability. One of many unique features of the mammalian brain network is its spatial embedding and hierarchical organization. I will discuss effects of these structural characteristics on network dynamics as well as their computational implications with a focus on the flexibility between modular and global computations and predictive coding.  

Markov chains and sampling methods for contiguous partitions

Series
Combinatorics Seminar
Time
Friday, November 18, 2022 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 202
Speaker
Wesley PegdenCarnegie Mellon University

With applications in the analysis of political districtings, Markov chains have become and essential tool for studying contiguous partitions of geometric regions. Nevertheless, there remains a dearth of rigorous results on the mixing times of the chains employed for this purpose. In this talk we'll discuss a sub-exponential bound on the mixing time of the Glauber dynamics chain for the case of bounded-size contiguous partition classes on certain grid-like classes of graphs.

Pages