- You are here:
- GT Home
- Home
- Seminars and Colloquia Schedule

Series: Dissertation Defense

Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One of the most known constrained low rank approximation method is nonnegative matrix factorization (NMF). This research studies the design and implementation of several variants of NMF for text, graph and hybrid data analytics. It will address challenges including solving new data analytics problems and improving the scalability of existing NMF algorithms. There are two major types of matrix representation of data: feature-data matrix and similarity matrix. Previous work showed successful application of standard NMF for feature-data matrix to areas such as text mining and image analysis, and Symmetric NMF (SymNMF) for similarity matrix to areas such as graph clustering and community detection. In this work, a divide-and-conquer strategy is applied to both methods to improve their time complexity from cubic growth with respect to the reduced low rank to linear growth, resulting in DC-NMF and HierSymNMF2 method. Extensive experiments on large scale real world data shows improved performance of these two methods.Furthermore, in this work NMF and SymNMF are combined into one formulation called JointNMF, to analyze hybrid data that contains both text content and connection structure information. Typical hybrid data where JointNMF can be applied includes paper/patent data where there are citation connections among content and email data where the sender/receipts relation is represented by a hypergraph and the email content is associated with hypergraph edges. An additional capability of the JointNMF is prediction of unknown network information which is illustrated using several real world problems such as citation recommendations of papers and activity/leader detection in organizations.The dissertation also includes brief discussions of relationship among different variants of NMF.

Series: CDSNS Colloquium

The derivative nonlinear Schrödinger equation (DNLS) is an integrable, mass-critical PDE. The integrals of motion may be written as an infinite sequence of functionals on Sobolev spaces of increasing regularity. I will show how to associate to them a family of invariant Gibbs measures, if the L^2 norm of the solution is sufficiently small (mass-criticality). A joint work with R. Lucà (Basel) and D. Valeri (Beijing).

Series: Geometry Topology Seminar

Series: Research Horizons Seminar

There
is so much that the GT library can do for you, from providing research
materials to assistance with data visualization to patent guidance.
However, rather than trying to guess what you want from us, this year we
asked!
Based on the response to a short ranking survey I sent out last month, this session will cover: 1. How to find grants, fellowships, and travel money with the sponsorship database, Pivot. There are opportunities for postdocs and non US citizens too!2. How to use MathSciNet. We will cover navigating its classification index to actually getting the article
you want. 3. How to find and download articles from our systems, Google Scholar, and from other libraries. And if we have time: 4. How to make a poster and cheaply print it.

Wednesday, March 14, 2018 - 14:00 ,
Location: Skiles 006 ,
Surena Hozoori ,
GaTech ,
Organizer: Anubhav Mukherjee

Assuming
some "compatibility" conditions between a Riemannian metric and a
contact structure on a 3-manifold, it is natural to ask whether
we can use methods in global geometry to get results in contact topology. There is a notion
of compatibility in this context which relates convexity concepts in
those geometries and is well studied concerning geometry questions, but
is not exploited for topological questions. I will talk about "contact
sphere theorem" due to Etnyre-Massot-Komendarczyk,
which might be the most interesting result for contact topologists.

Series: Dissertation Defense

I will discuss two topics in Dynamical Systems. A uniformly hyperbolic dynamical system preserving Borel probability measure μ is called fair dice like or FDL if there exists a finite Markov partition ξ of its phase space M such that for any integers m and j(i), 1 ≤ j(i) ≤ q one has μ ( C(ξ, j(0)) ∩ T^(-1) C(ξ, j(1)) ∩ ... ∩ T^(-m+1)C(ξ, j(m-1)) ) = q^(-m) where q is the number of elements in the partition ξ and C(ξ, j) is element number j of ξ. I discuss several results about such systems concerning finite time prediction regarding the first hitting probabilities of the members of ξ. Then I will discuss a natural modification to all billiard models which is called the Physical Billiard. For some classes of billiard, this modification completely changes their dynamics. I will discuss a particular example derived from the Ehrenfests' Wind-Tree model. The Physical Wind-Tree model displays interesting new dynamical behavior that is at least as rich as some of the most well studied examples that have come before.

Friday, March 16, 2018 - 10:00 ,
Location: Skiles 006 ,
Kisun Lee ,
Georgia Tech ,
klee669@gatech.edu ,
Organizer: Kisun Lee

Expanding the topic we discussed on last week, we consider the way to certify roots for system of equations with D-finite functions. In order to do this, we will first introduce the notion of D-finite functions, and observe the property of them. We also suggest two different ways to certify this, that is, alpha-theory and the Krawczyk method. We use the concept of majorant series for D-finite functions to apply above two methods for certification. After considering concepts about alpha-theory and the Krawczyk method, we finish the talk with suggesting some open problems about these.

Series: ACO Student Seminar

A low-diameter decomposition (LDD) of an undirected graph G is a partitioning of G into components of bounded diameter, such that only a small fraction of original edges are between the components. This decomposition has played instrumental role
in the design of low-stretch spanning tree, spanners, distributed algorithms etc.
A natural question is whether such a decomposition can be efficiently maintained/updated as G undergoes insertions/deletions of edges. We make the first step towards answering this question by designing a fully-dynamic graph algorithm that maintains an
LDD in sub-linear update time.
It is known that any undirected graph G admits a spanning tree T with nearly logarithmic average stretch, which can be computed in nearly linear-time. This tree decomposition underlies many recent progress in static algorithms for combinatorial and scientific
flows. Using our dynamic LDD algorithm, we present the first non-trivial algorithm that dynamically maintains a low-stretch spanning tree in \tilde{O}(t^2) amortized update time, while achieving (t + \sqrt{n^{1+o(1)}/t}) stretch, for every 1 \leq t \leq n.
Joint work with Sebastian Krinninger.

Friday, March 16, 2018 - 14:00 ,
Location: Skiles 006 ,
Jen Hom ,
Georgia Tech ,
Organizer: Jennifer Hom

In this series of talks, we will study the relationship between the Alexander module and the bordered Floer homology of the Seifert surface complement. In particular, we will show that bordered Floer categorifies Donaldson's TQFT description of the Alexander module.

Series: Math Physics Seminar

Consider a relativistic electron interacting with a nucleus of nuclear charge Z and coupled to its self-generated electromagnetic field. The resulting system of equations describing the time evolution of this electron and its corresponding vector potential are known as the Maxwell-Dirac-Coulomb (MDC) equations. We study the time local well-posedness of the MDC equations, and, under reasonable restrictions on the nuclear charge Z, we prove the existence of a unique local in time solution to these equations.

Series: Combinatorics Seminar

The (type A) Hecke algebra H_n(q) is an n!-dimensional q-analog of the symmetric group. A related trace space of certain functions on H_n(q) has dimension equal to the number of integer partitions of n. If we could evaluate all functions belonging to some basis of the trace space on all elements of some basis of H_n(q), then by linearity we could evaluate em all traces on all elements of H_n(q). Unfortunately there is no simple published formula which accomplishes this. We will consider a basis of H_n(q) which is related to structures called wiring diagrams, and a combinatorial rule for evaluating one trace basis on all elements of this wiring diagram basis. This result, the first of its kind, is joint work with Justin Lambright and Ryan Kaliszewski.

Friday, March 16, 2018 - 15:05 ,
Location: Skiles 271 ,
Longmei Shu ,
GT Math ,
Organizer: Jiaqi Yang

Isospectral reductions decrease the dimension of the adjacency matrix
while keeping all the eigenvalues. This is achieved by using rational
functions in the entries of the reduced matrix. I will show how it's
done through an example. I will also discuss about the eigenvectors and
generalized eigenvectors before and after reductions.