Seminars and Colloquia by Series

Wednesday, July 3, 2019 - 11:00 , Location: Skiles 006 , Marcel Celaya , Georgia Tech , mcelaya@gatech.edu , Organizer: Marcel Celaya

The first half of this dissertation concerns the following problem: Given a lattice in $\mathbf{R}^d$ which refines the integer lattice $\mathbf{Z}^d$, what can be said about the distribution of the lattice points inside of the half-open unit cube $[0,1)^d$? This question is of interest in discrete geometry, especially integral polytopes and Ehrhart theory. We observe a combinatorial description of the linear span of these points, and give a formula for the dimension of this span. The proofs of these results use methods from classical multiplicative number theory.

In the second half of the dissertation, we investigate oriented matroids from the point of view of tropical geometry. Given an oriented matroid, we describe, in detail, a polyhedral complex which plays the role of the Bergman complex for ordinary matroids. We show how this complex can be used to give a new proof of the celebrated Bohne-Dress theorem on tilings of zonotopes by zonotopes with an approach which relies on a novel interpretation of the chirotope of an oriented matroid.

Wednesday, June 5, 2019 - 14:00 , Location: Skiles 202 , Longmei Shu , Georgia Inst. of Technology , lshu6@gatech.edu , Organizer: Longmei Shu

Isospectral reductions is a network/graph reduction that preserves the
eigenvalues and the eigenvectors of the adjacency matrix. We analyze the
conditions under which the generalized eigenvectors would be preserved and
simplify the proof of the preservation of eigenvectors. Isospectral reductions
are associative and form a dynamical system on the set of all matrices/graphs.
We study the spectral equivalence relation defined by specific characteristics
of nodes under isospectral reductions and show some examples of the attractors.
Cooperation among antigens, cross-immunoreactivity (CR) has been observed in
various diseases. The complex viral population dynamics couldn't be explained
by traditional math models. A new math model was constructed recently with
promising numerical simulations. In particular, the numerical results recreated
local immunodeficiency (LI), the phenomenon where some viruses sacrifice
themselves while others are not attacked by the immune system. Here we analyze
small CR networks to find the minimal network with a stable LI. We also
demonstrate that you can build larger CR networks with stable LI using this
minimal network as a building block.

Friday, May 3, 2019 - 10:00 , Location: Skiles 005 , Sergio Mayorga , Graduate student , smayorga3@gatech.edu , Organizer: Sergio Mayorga

For a first order (deterministic) mean-field game with non-local running and initial couplings, a classical solution is constructed for the associated, so-called master equation, a partial differential equation in infinite-dimensional space with a non-local term, assuming the time horizon is sufficiently small and the coefficients are smooth enough, without convexity conditions on the Hamiltonian. 

Thursday, May 2, 2019 - 13:30 , Location: Skiles 006 , Bounghun Bock , Georgia Tech , bbock3@gatech.edu , Organizer: Bounghun Bock

In independent bond percolation  with parameter p, if one removes the vertices of the infinite cluster (and incident edges), for which values of p does the remaining graph contain an infinite cluster? Grimmett-Holroyd-Kozma used the triangle condition to show that for d > 18, the set of such p contains values strictly larger than the percolation threshold pc. With the work of Fitzner-van der Hofstad, this has been reduced to d > 10. We reprove this result by showing that for d > 10 and some p>pc, there are infinite paths consisting of "shielded"' vertices --- vertices all whose adjacent edges are closed --- which must be in the complement of the infinite cluster. Using numerical values of pc, this bound can be reduced to d > 7. Our methods are elementary and do not require the triangle condition.

Invasion percolation is a stochastic growth model that follows a greedy algorithm. After assigning i.i.d. uniform random variables (weights) to all edges of d-dimensional space, the growth starts at the origin. At each step, we adjoin to the current cluster the edge of minimal weight from its boundary. In '85, Chayes-Chayes-Newman studied the "acceptance profile"' of the invasion: for a given p in [0,1], it is the ratio of the expected number of invaded edges until time n with weight in [p,p+dp] to the expected number of observed edges (those in the cluster or its boundary) with weight in the same interval. They showed that in all dimensions, the acceptance profile an(p) converges to one for p<pc and to zero for p>pc. In this paper, we consider an(p) at the critical point p=pc in two dimensions and show that it is bounded away from zero and one as n goes to infinity.

Thursday, May 2, 2019 - 11:00 , Location: Skiles 006 , Rohan Ghanta , School of Mathematics , rghanta3@math.gatech.edu , Organizer: Rohan Ghanta

An electron interacting with the vibrational modes of a polar crystal is called a polaron. Polarons are the simplest Quantum Field Theory models, yet their most basic features such as the effective mass, ground-state energy and wave function cannot be evaluated explicitly. And while several successful theories have been proposed over the years to approximate the energy and effective mass of various polarons, they are built entirely on unjustified, even questionable, Ansätze for the wave function. 

In this talk I shall provide the first explicit description of the ground-state wave function of a polaron in an asymptotic regime: For the Fröhlich polaron localized in a Coulomb potential and exposed to a homogeneous magnetic field of strength $B$ it will be shown that the ground-state electron density in the direction of the magnetic field converges pointwise and in a weak sense as $B\rightarrow\infty$ to the square of a hyperbolic secant function--a sharp contrast to the Gaussian wave functions suggested in the physics literature. 

Wednesday, April 17, 2019 - 10:00 , Location: Skiles 006 , Haoyan Zhai , Georgia Tech , hzhai8@gatech.edu , Organizer: Haoyan Zhai

Optimal transport is a thoroughly studied field in mathematics and introduces the concept of Wasserstein distance, which has been widely used in various applications in computational mathematics, machine learning as well as many areas in engineering. Meanwhile, control theory and path planning is an active branch in mathematics and robotics, focusing on algorithms that calculates feasible or optimal paths for robotic systems. In this defense, we use the properties of the gradient flows in Wasserstein metric to design algorithms to handle different types of path planning and control problems as well as the K-means problems defined on graphs.

Tuesday, April 9, 2019 - 14:00 , Location: Skiles 006 , Andrew McCullough , Georgia Institute of Technology , andrew.mccullough@gatech.edu , Organizer: Andrew McCullough

We define the notion of a knot type having Legendrian large cables and
show that having this property implies that the knot type is not uniformly thick.
Moreover, there are solid tori in this knot type that do not thicken to a solid torus
with integer sloped boundary torus, and that exhibit new phenomena; specifically,
they have virtually overtwisted contact structures. We then show that there exists
an infinite family of ribbon knots that have Legendrian large cables. These knots fail
to be uniformly thick in several ways not previously seen. We also give a general
construction of ribbon knots, and show when they give similar such examples.

Monday, April 8, 2019 - 12:10 , Location: Skiles 202 , Jiangning Chen , Georgia Institute of Technology , jchen444@gatech.edu , Organizer:

We are going talk about three topics. First of all, Principal Components Analysis (PCA) as a dimension reduction technique. We investigate how useful it is for real life problems. The problem is that, often times the spectrum of the covariance matrix is wrongly estimated due to the ratio between sample space dimension over feature space dimension not being large enough. We show how to reconstruct the spectrum of the ground truth covariance matrix, given the spectrum of the estimated covariance for multivariate normal vectors. We then present an algorithm for reconstruction the spectrum in the case of sparse matrices related to text classification. 

In the second part, we concentrate on schemes of PCA estimators. Consider the problem of finding the least eigenvalue and eigenvector of ground truth covariance matrix, a famous classical estimator are due to Krasulina. We state the convergence proof of Krasulina for the least eigenvalue and corresponding eigenvector, and then find their convergence rate.

In the last part, we consider the application problem, text classification, in the supervised view with traditional Naive-Bayes method. We find out an updated Naive-Bayes method with a new loss function, which loses the unbiased property of traditional Naive-Bayes method, but obtains a smaller variance of the estimator. 

Committee:  Heinrich Matzinger (Advisor); Karim Lounici (Advisor); Ionel Popescu (school of math); Federico Bonetto (school of math); Xiaoming Huo (school of ISYE);

Tuesday, March 12, 2019 - 13:30 , Location: Skiles 005 , George Kerchev , Georgia Tech , Organizer: George Kerchev

The length LC_n of the longest common subsequences of two strings X = (X_1, ... , X_n) and Y = (Y_1, ... , Y_n) is a way to measure the similarity between X and Y. We study the asymptotic behavior of LC_n when the two strings are generated by a hidden Markov model (Z, (X, Y)) and we build upon asymptotic results for LC_n obtained for sequences of i.i.d. random variables. Under some standard assumptions regarding the model we first prove convergence results with rates for E[LC_n]. Then, versions of concentration inequalities for the transversal fluctuations of LC_n are obtained. Finally, we outline a proof for a central limit theorem by building upon previous work and adapting a Stein's method estimate.

Tuesday, March 12, 2019 - 10:00 , Location: 203 Classroom D.M. Smith , Qiqin Xie , Georgia Institute of Technology , Organizer: Qiqin Xie

The Four Color Theorem states that every planar graph is 4-colorable. Hajos conjectured that for any positive integer k, every graph containing no K_{k+1}-subdivision is k-colorable. However, Catlin disproved Hajos' conjecture for k >= 6. It is not hard to prove that the conjecture is true for k <= 3. Hajos' conjecture remains open for k = 4 and k = 5. We consider a minimal counterexample to Hajos' conjecture for k = 4: a graph G, such that G contains no K_5-subdivision, G is not 4-colorable, and |V (G)| is minimum. We use Hajos graph to denote such counterexample. One important step to understand graphs containing K_5-subdivisions is to solve the following problem: let H represent the tree on six vertices, two of which are adjacent and of degree 3. Let G be a graph and u1, u2, a1, a2, a3, a4 be distinct vertices of G. When does G contain a topological H (i.e. an H-subdivision) in which u1, u2 are of degree 3 and a1, a2, a3, a4 are of degree 1? We characterize graphs with no topological H. This characterization is used by He, Wang, and Yu to show that graph containing no K_5-subdivision is planar or has a 4-cut, establishing conjecture of Kelmans and Seymour. Besides the topological H problem, we also obtained some further structural information of Hajos graphs.

Pages