Seminars and Colloquia by Series

Log-Sobolev Inequalities and Their Applications

Series
Analysis Working Seminar
Time
Monday, September 8, 2014 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
George KerchevSchool of Math
This talk will concern Log-Sobolev inequalities and their applications. We will discuss connections to exponential convergence of Markov semigroups, the Poincare inequality and Gaussian concentration. It's the first part of a series.

Computation of normally hyperbolic invariant manifolds

Series
Applied and Computational Mathematics Seminar
Time
Monday, September 8, 2014 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dr. Marta CanadellGeorgia Tech Mathematics
We explain a method for the computation of normally hyperbolic invariant manifolds (NHIM) in discrete dynamical systems.The method is based in finding a parameterization for the manifold formulating a functional equation. We solve the invariance equation using a Newton-like method taking advantage of the dynamics and the geometry of the invariant manifold and its invariant bundles. The method allows us to compute a NHIM and its internal dynamics, which is a-priori unknown.We implement this method to continue the invariant manifold with respect to parameters, and to explore different mechanisms of breakdown. This is a joint work with Alex Haro.

A Central Limit Theorem for the Length of the Longest Common Subsequence in Random Words

Series
Stochastics Seminar
Time
Thursday, September 4, 2014 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Christian HoudreSchool of Mathematics, Georgia Tech
Let (X_k)_{k \geq 1} and (Y_k)_{k\geq1} be two independent sequences of independent identically distributed random variables having the same law and taking their values in a finite alphabet \mathcal{A}_m. Let LC_n be the length of the longest common subsequence of the random words X_1\cdots X_n and Y_1\cdots Y_n. Under assumptions on the distribution of X_1, LC_n is shown to satisfy a central limit theorem. This is in contrast to the Bernoulli matching problem or to the random permutations case, where the limiting law is the Tracy-Widom one. (Joint with Umit Islak)

Exams: the devil is in the details

Series
Professional Development Seminar
Time
Wednesday, September 3, 2014 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Brett Wick and Rafael de la LlaveGeorgia Tech
A discussion of case studies on the making, giving, grading, etc. of exams, followed by course group meetings for 2401 and 2403.

Reconstruction Problems in Geometry

Series
Research Horizons Seminar
Time
Wednesday, September 3, 2014 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dr. Dan MargalitGeorgia Tech Math Department
Here is a classical theorem. Consider a bijection (just a set map!) from the Euclidean plane to itself that takes 0 to 0 and takes the points on an arbitrary line to the points on a (possibly different line). The theorem is that such a bijection always comes from a linear map. I'll discuss various generalizations of this theorem in geometry, topology, and algebra, ending with a discussion of some recent, related research on the topology of surfaces.

A mathematical model of immune regulation: why we aren't all dead from autoimmune disease

Series
Mathematical Biology Seminar
Time
Wednesday, September 3, 2014 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
James MooreSoM GaTech
The immune system must simultaneously mount a response against foreign antigens while tolerating self. How this happens is still unclear as many mechanisms of immune tolerance are antigen non-specific. Antigen specific immune cells called T-cells must first bind to Immunogenic Dendritic Cells (iDCs) before activating and proliferating. These iDCs present both self and foreign antigens during infection, so it is unclear how the immune response can be limited to primarily foreign reactive T-cells. Regulatory T-cells (Tregs) are known to play a key role in self-tolerance. Although they are antigen specific, they also act in an antigen non-specific manner by competing for space and growth factors as well as modifying DC behaviorto help kill or deactivate other T-cells. In prior models, the lack of antigen specific control has made simultaneous foreign-immunity and self-tolerance extremely unlikely. We include a heterogeneous DC population, in which different DCs present antigens at different levels. In addition, we include Tolerogenic DC (tDCs) which can delete self-reactive T-cells under normal physiological conditions. We compare different mathematical models of immune tolerance with and without Tregs and heterogenous antigen presentation.For each model, we compute the final number of foreign-reactive and self-reactive T-cells, under a variety of different situations.We find that even if iDCs present more self antigen than foreign antigen, the immune response will be primarily foreign-reactive as long as there is sufficient presentation of self antigen on tDCs. Tregs are required primarily for rare or cryptic self-antigens that do not appear frequently on tDCs. We also find that Tregs can onlybe effective when we include heterogenous antigen presentation, as this allows Tregs and T-cells of the same antigen-specificity to colocalize to the same set of DCs. Tregs better aid immune tolerance when they can both compete forspace and growth factors and directly eliminate other T-cells. Our results show the importance of the structure of the DC population in immune tolerance as well as the relative contribution of different cellular mechanisms.

Improved Approximation for Weighted Bipartite Edge Coloring

Series
Combinatorics Seminar
Time
Tuesday, September 2, 2014 - 13:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Arindam KhanGeorgia Tech
Weighted Bipartite Edge Coloring problem is a generalization of two classical optimization problems: Bipartite Edge Coloring and Bin Packing. Given an edge-weighted bipartite multi-graph G, the goal is to color all edges with minimum colors such that the sum of the edges incident to any vertex of any color is at most one. Chung and Ross conjectured that given an instance of the weighted bipartite edge coloring problem, there is a proper weighted coloring using at most 2n-1 colors where n denotes the maximum over all the vertices of the number of unit-sized bins needed to pack the weights of edges incident at the vertex. In this talk I will present an algorithm that gives a proper weighted coloring using $20n/9$ colors and improved results for some special cases. I will also present an alternative proof of Konig's edge coloring theorem using skew-supermodular functions. The talk will have all three components of ACO: Approximation Algorithms, Graph Theory and Supermodular Optimization.

Pages