Seminars and Colloquia by Series

Graph Structure in Polynomial Ideals: Chordal Networks

Series
Algebra Seminar
Time
Friday, April 14, 2017 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Diego CifuentesMIT
We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables. Chordal networks provide a computationally convenient decomposition of a polynomial ideal into simpler (triangular) polynomial sets, while preserving its underlying graphical structure. We show that many interesting families of polynomial ideals admit compact chordal network representations (of size linear in the number of variables), even though the number of components could be exponentially large. Chordal networks can be computed for arbitrary polynomial systems, and they can be effectively used to obtain several properties of the variety, such as its dimension, cardinality, equidimensional components, and radical ideal membership. We apply our methods to examples from algebraic statistics and vector addition systems; for these instances, algorithms based on chordal networks outperform existing techniques by orders of magnitude.

A career in mathematics research outside of the academy

Series
Professional Development Seminar
Time
Thursday, April 13, 2017 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Amanda StreibIDA/CCS
A conversation with Amanda Streib, a 2012 GT ACO PhD, who is now working at the Institute for Defense Analyses - Center for Computing Sciences (IDA/CCS) and who was previously a National Research Council (NRC) postdoc at the Applied and Computational Mathematics Division of the National Institute of Standards and Technology (NIST).

Some Remarks on Stein's Method

Series
Stochastics Seminar
Time
Thursday, April 13, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Christian HoudréSchool of Mathematics, Georgia Institute of Technology
I will revisit the classical Stein's method, for normal random variables, as well as its version for Poisson random variables and show how both (as well as many other examples) can be incorporated in a single framework.

Statistical Inference for Some Risk Measures

Series
Dissertation Defense
Time
Wednesday, April 12, 2017 - 14:30 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Yanxi HouGeorgia Institute of Technology
This thesis addresses asymptotic behaviors and statistical inference methods for several newly proposed risk measures, including relative risk and conditional value-at-risk. These risk metrics are intended to measure the tail risks and/or systemic risk in financial markets. We consider conditional Value-at-Risk based on a linear regression model. We extend the assumptions on predictors and errors of the model, which make the model more flexible for the financial data. We then consider a relative risk measure based on a benchmark variable. The relative risk measure is proposed as a monitoring index for systemic risk of financial system. We also propose a new tail dependence measure based on the limit of conditional Kendall’s tau. The new tail dependence can be used to distinguish between the asymptotic independence and dependence in extreme value theory. For asymptotic results of these measures, we derive both normal and Chi-squared approximations. These approximations are a basis for inference methods. For normal approximation, the asymptotic variances are too complicated to estimate due to the complex forms of risk measures. Quantifying uncertainty is a practical and important issue in risk management. We propose several empirical likelihood methods to construct interval estimation based on Chi-squared approximation.

Falconer type theorems for simplices

Series
Analysis Seminar
Time
Wednesday, April 12, 2017 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Eyvi PalssonVirginia Tech
Finding and understanding patterns in data sets is of significant importance in many applications. One example of a simple pattern is the distance between data points, which can be thought of as a 2-point configuration. Two classic questions, the Erdos distinct distance problem, which asks about the least number of distinct distances determined by N points in the plane, and its continuous analog, the Falconer distance problem, explore that simple pattern. Questions similar to the Erdos distinct distance problem and the Falconer distance problem can also be posed for more complicated patterns such as triangles, which can be viewed as 3-point configurations. In this talk I will present recent progress on Falconer type problems for simplices. The main techniques used come from analysis and geometric measure theory.

Lower bound on the minimal number of periodic Reeb orbits

Series
Geometry Topology Seminar
Time
Wednesday, April 12, 2017 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jean GuttUGA
I will present the recent result with P.Albers and D.Hein that every graphical hypersurface in a prequantization bundle over a symplectic manifold M pinched between two circle bundles whose ratio of radii is less than \sqrt{2} carries either one short simple periodic orbit or carries at least cuplength(M)+1 simple periodic Reeb orbits.

What is Heegaard Floer homology?

Series
Research Horizons Seminar
Time
Wednesday, April 12, 2017 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jen HomGeorgia Tech
Defined in the early 2000's by Ozsvath and Szabo, Heegaard Floer homology is a package of invariants for three-manifolds, as well as knots inside of them. In this talk, we will describe how work from Poul Heegaard's 1898 PhD thesis, namely the idea of a Heegaard splitting, relates to the definition of this invariant. We will also provide examples of the kinds of questions that Heegaard Floer homology can answer. These ideas will be the subject of the topics course that I am teaching in Fall 2017.

A Few Fairy Math Tales

Series
CDSNS Colloquium
Time
Tuesday, April 11, 2017 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Dmitri BuragoPenn State
The format of this talk is rather non-standard. It is actually a combination of two-three mini-talks. They would include only motivations, formulations, basic ideas of proof if feasible, and open problems. No technicalities. Each topicwould be enough for 2+ lectures. However I know the hard way that in diverse audience, after 1/3 of allocated time 2/3 of people fall asleep or start playing with their tablets. I hope to switch to new topics at approximately right times.The topics will probably be chosen from the list below.“A survival guide for feeble fish”. How fish can get from A to B in turbulent waters which maybe much fasted than the locomotive speed of the fish provided that there is no large-scale drift of the water flow. This is related tohomogenization of G-equation which is believed to govern many combustion processes. Based on a joint work with S. Ivanov and A. Novikov.How can one discretize elliptic PDEs without using finite elements, triangulations and such? On manifolds and even reasonably “nice” mm–spaces. A notion of rho-Laplacian and its stability. Joint with S. Ivanov and Kurylev.One of the greatest achievements in Dynamics in the XX century is the KAM Theory. It says that a small perturbation of a non-degenerate completely integrable system still has an overwhelming measure of invariant tori with quasi-periodicdynamics. What happens outside KAM tori has been remaining a great mystery. The main quantative invariants so far are entropies. It is easy, by modern standards, to show that topological entropy can be positive. It lives, however,on a zero measure set. We were able to show that metric entropy can become infinite too, under arbitrarily small C^{infty} perturbations. Furthermore, a slightly modified construction resolves another long–standing problem of theexistence of entropy non-expansive systems. These modified examples do generate positive positive metric entropy is generated in arbitrarily small tubular neighborhood of one trajectory. The technology is based on a metric theory of“dual lens maps” developed by Ivanov and myself, which grew from the “what is inside” topic.How well can we approximate an (unbounded) space by a metric graph whose parameters (degree of vertices, length of edges, density of vertices etc) are uniformly bounded? We want to control the ADDITIVE error. Some answers (the mostdifficult one is for R^2) are given using dynamics and Fourier series.“What is inside?” Imagine a body with some intrinsic structure, which, as usual, can be thought of as a metric. One knows distances between boundary points (say, by sending waves and measuring how long it takes them to reach specific points on the boundary). One may think of medical imaging or geophysics. This topic is related to the one on minimal fillings, the next one. Joint work with S. Ivanov.Ellipticity of surface area in normed space. An array of problems which go back to Busemann. They include minimality of linear subspaces in normed spaces and constructing surfaces with prescribed weighted image under the Gauss map. I will try to give a report of recentin “what is inside?” mini-talk. Joint with S. Ivanov.More stories are left in my left pocket. Possibly: On making decisions under uncertain information, both because we do not know the result of our decisions and we have only probabilistic data.

Polyrhythms everywhere!

Series
Other Talks
Time
Monday, April 10, 2017 - 19:00 for 1.5 hours (actually 80 minutes)
Location
Bill Moore Student Sucess Center - Cleary Theatre
Speaker
Tom MorleyGeorgia Institute of Technology
Rhythm is a great thing. It therefore follows that several rhythms at once is even greater. Learn 2:3, 3:4, and 4:5, and a little bit about fractions. Polyrhythms when sped up, lead to harmony and scales. Slower polyrhythms happen in celestial mechanics. A little bit of music, a little bit of mathematics.

Pages