# All Seminars

Title: Ranking Instagram Preferences: Get to know your friends better through experimental mathematics
Defense: Honors Thesis
Speaker: Urshila Choubal of Emory University
Contact: Urshila Choubal, urshila.vikram.choubal@emory.edu
Date: 2022-04-07 at 10:00AM
Venue: MSC E406
Abstract:
Ranking methods offer remarkable potential in creating and revamping recommendation systems. The task of suggesting relevant and attractive content to users is directly benefited by improving ranking techniques. With graph ranking as the mathematical foundation on which recommendation systems are built, vertex prestige is a critical problem to be addressed. Several models exist that rank vertices in a graph. However, we explore the following methods: HITS, Dominant Eigenvector, and PageRank. We aim to emulate a recommendation system by first gathering primary data from Instagram by tracking the activity of nine participants on the app. With the help of the three ranking methods, we intend to provide our recommendation to the participants based on having accessed their past preferences.
Title: Residue on affine Grasmannians
Seminar: Algebra
Speaker: Philippe Gille of CNRS, Université Lyon 1
Contact: David Zureick-Brown, dzureic@emory.edu
Date: 2022-04-05 at 4:00PM
Venue: MSC W303
Abstract:
This is a report on joint work with Mathieu Florence. For an affine algebraic group $G/k$, we will explain how a non integral point of $G( k((t)) )$ gives rise to a homomorphism $H \to G$ where $H$ is either the additive group or the multiplicative group.
Title: Forbidden subgraphs and spherical two distance sets
Seminar: Discrete Math
Speaker: Zilin Jiang of Arizona State University
Contact: Liana Yepremyan, liana.yepremyan@EMORY.EDU
Date: 2022-04-01 at 4:00PM
Venue: MSC W303
Abstract:
Given a real number $\lambda$, what can we say about the family G($\lambda$) of graphs with eigenvalues bounded from below by -$\lambda$The Cauchy interlacing theorem implies that that the family G($\lambda$) is closed under taking (induced) subgraphs. Similar to Wagner’s theorem, which describes the family of planar graphs by finite forbidden minors, it is natural to ask for which $\lambda$ the family G($\lambda$) has a finite forbidden subgraph characterization. In this talk, I will illustrate the key ideas in answering this question, and I will demonstrate a peculiar connection to spherical two distance sets — a set of unit vectors in a Euclidean space the pairwise inner products of which assume only two values. Joint work with Alexandr Polyanskii, Jonathan Tidor, Yuan Yao, Shengtong Zhang and Yufei Zhao.
Title: The Georgia Algebraic Geometry Symposium
Seminar: Algebra
Speaker: {} of
Contact: David Zureick-Brown, david.zureick-brown@emory.edu
Date: 2022-04-01 at 5:00PM
Venue: MSC E208
Abstract:
The Georgia Algebraic Geometry Symposium is a conference series, jointly organized by the University of Georgia, Emory University and Georgia Tech. \\ The conference will begin Friday late afternoon and end Sunday early afternoon. \\ See {https://www.math.emory.edu/$\sim$ dzb/conferences/GAGS2022/} for more information. \\ Speakers: \\ Evangelia Gazaki (University of Virginia) \\ Roman Fedorov (University of Pittsburgh)\\ Angela Gibney (University of Pennsylvania)\\ Philippe Gille (Institut Camille Jordan)\\ Diego Izquierdo (École Polytechnique)\\ Martin Olsson (University of California, Berkeley)\\ Karl Schwede (University of Utah)\\ Brooke Ullery (Emory University)\\
Title: Multiphase fluid dynamics at leadership-class scale: Models, numerics, and algorithms
Seminar: Computational Math
Speaker: Spencer Bryngelson of Georgia Institute of Technology
Contact: Yuanzhe Xi, yuanzhe.xi@emory.edu
Date: 2022-03-31 at 10:00AM
Venue: MSC W201
Abstract:
Computational fluid dynamics (CFD) simulations utilize the lions share of HPC resources the world over. Still, the CFD community has a fragmented and generally closed-source software stack. This paradigm must change if the community hopes to keep pace with the rapid evolution of HPC resources,. In this talk I will present our efforts in this direction. State-of-the-art computational models for simulating multiphase flows will be presented with application to problems in biomedicine, defense, and energy. Algorithms for near-optimal performance on the latest HPC resources will be interrogated. I will also discuss our effort towards painless embedding of the ever more common data-driven models in scalable simulation codes. All software discussed in this talk is freely and openly available on our Github pages with permissive licensing: https://github.com/comp-physics and https://github.com/mflowcode
Seminar: Algebra
Speaker: Andrew Kobin of Emory University
Contact: David Zureick-Brown, dzureic@emory.edu
Date: 2022-03-29 at 4:00PM
Venue: MSC W303
Abstract:
Zeta functions show up everywhere in math these days. While some work in the past has brought homotopical methods into the theory of zeta functions, there is in fact a lesser-known zeta function that is native to homotopy theory. Namely, every suitably finite decomposition space (aka 2-Segal space) admits an abstract zeta function as an element of its incidence algebra. In this talk, I will show how many 'classical' zeta functions from number theory and algebraic geometry can be realized in this homotopical framework, and briefly advertise an upcoming preprint (joint with Jon Aycock) that categorifies the Dedekind zeta function of a quadratic number field.
Title: Improving Multigrid Methods with Deep Neural Networks
Defense: Dissertation
Speaker: Ru Huang of Emory University
Contact: Ru Huang, ru.huang@emory.edu
Date: 2022-03-28 at 10:30AM
Venue: MSC N215
Abstract:
Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from Partial Differential Equations (PDEs) and graph Laplacians from machine learning applications. There are two key components of multigrid, smoothing which aims at reducing high-frequency errors on each grid level, and coarse grid correction which interpolates the solution at the coarse grid. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. Meanwhile, as the multigrid hierarchy is formed, coarse-grid operators have significantly more nonzeros per row than the original fine-grid operator, which generates high parallel communication costs on coarse-levels. In this talk, I will first talk about my research on developing an efficient adaptive framework for learning optimal smoothers from operator stencils in the form of convolutional neural networks (CNNs). I will also talk about our deep learning framework for sparsifying coarse grid operators. I will demonstrate how these techniques can be used for challenging anisotropic rotated Laplacian problems, variable coefficient diffusion problems, and linear elasticity problems.
Title: Generating Graphs with Deep Learning and Graph Theory
Defense: Dissertation
Speaker: Yuliang Ji of Emory University
Contact: Yuliang Ji, yuliang.ji@emory.edu
Date: 2022-03-25 at 9:00AM
Venue: MSC E406
Abstract:
Deep generative models attract lots of attention in recent years. With deep neural networks and specific designs, deep generative models can generate high-quality realistic data. In this dissertation, I focus on combining the deep generative models with the traditional graph theory algorithms to reduce the dependence on the volume of the training data and improve the quality of the generated graphs. I first propose a deep learning method to improve the Havel-Hakimi graph realization algorithm to generate doppelganger graphs from a single graph. Second, I present a few new architectures of normalizing flow models with improved performance and theoretical guarantees. Finally, I develop a permutation invariant method via leveraging graph theory and denoising diffusion models for generating molecular graphs.
Title: The Laplace and Heat Operators on Quantum Graphs
Defense: Dissertation
Speaker: Kenny Jones of Emory University
Contact: Wesley Jones, wesley.kenderdine.jones@emory.edu
Date: 2022-03-24 at 3:00PM
Venue: Emerson E363
Abstract:
This presentation will introduce general strategies, techniques, and results for differential operators on quantum graphs. The focus of the talk will be on new results presented in my doctoral dissertation. The first result is a sharp diameter bound on the spectral gap for quantum graphs. Followed by a new technique for bounding the heat kernel on quantum graphs and several bounds for the heat kernel. Finally, I will present an original equation and derivation of the mean value theorem for the heat equation on quantum graphs and give a bound for the mean value theorem.
Title: Codes from Fiber Products of Curves
Seminar: Algebra
Speaker: Mckenzie West of University of Wisconsin - Eau Claire
Contact: David Zureick-Brown, dzureic@emory.edu
Date: 2022-03-22 at 4:00PM
Venue: MSC W303
Abstract:
Error correcting codes are used to store information efficiently while still allowing for recovery in the case of partial loss. Recently work has begun to construct codes using the algebraic geometric properties of curves over finite fields. In this talk, we'll introduce the general construction of codes from fiber products curves and provide a few explicit examples of locally recoverable codes created using these methods. This collaborative work started at the inaugural Rethinking Number Theory workshop in October 2020.