Seminars and Colloquia by Series

Higher Prym Representations of the Mapping Class Group

Series
Geometry Topology Student Seminar
Time
Wednesday, February 20, 2013 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Becca WinarskiGeorgia Tech
A conjecture of Ivanov asserts that finite index subgroups of the mapping class group of higher genus surfaces have trivial rational homology. Putman and Wieland use what they call higher Prym representations, which are extensions of the representation induced by the action of the mapping class group on homology, to better understand the conjecture. In particular, they prove that if Ivanov's conjecture is true for some genus g surface, it is true for all higher genus surfaces. On the other hand, they also prove that if there is a counterexample to Ivanov's conjecture, it is of a specific form.

Nonparametric estimation of log-concave densities

Series
Stochastics Seminar
Time
Tuesday, February 19, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skyles 005
Speaker
Jon A. WellnerUniversity of Washington
I will review recent progress concerning nonparametric estimation of log-concave densities and related families in $R^1$ and $R^d$. In the case of $R^1$, I will present limit theory for the estimators at fixed points at which the population density has a non-zero second derivative and for the resulting natural mode estimator under a corresponding hypothesis. In the case of $R^d$ with $d\ge 2$ will briefly discuss some recent progress and sketch a variety of open problems.

Homogenization of a generalized Stefan Problem\\ in the context of ergodic algebras

Series
PDE Seminar
Time
Tuesday, February 19, 2013 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Prof. Hermano FridIMPA, Rio De Janeiro, Braizil
We address the deterministic homogenization, in the general context of ergodic algebras, of a doubly nonlinear problem whichgeneralizes the well known Stefan model, and includes the classical porous medium equation. It may be represented by the differential inclusion, for a real-valued function $u(x,t)$, $$0\in \frac{\partial}{\partial t}\partial_u \Psi(x/\ve,x,u)+\nabla_x\cdot \nabla_\eta\psi(x/\ve,x,t,u,\nabla u) - f(x/\ve,x,t, u), $$ on a bounded domain $\Om\subset \R^n$, $t\in(0,T)$, together with initial-boundary conditions, where $\Psi(z,x,\cdot)$ is strictly convex and $\psi(z,x,t,u,\cdot)$ is a $C^1$ convex function, both with quadratic growth,satisfying some additional technical hypotheses. As functions of the oscillatory variable, $\Psi(\cdot,x,u),\psi(\cdot,x,t,u,\eta)$ and $f(\cdot,x,t,u)$ belong to the generalized Besicovitch space $\BB^2$ associated with an arbitrary ergodic algebra $\AA$. The periodic case was addressed by Visintin (2007), based on the two-scale convergence technique. Visintin's analysis for the periodic case relies heavily on the possibility of reducing two-scale convergence to usual $L^2$ convergence in the Cartesian product $\Om\X\Pi$, where $\Pi$ is the periodic cell. This reduction is no longer possible in the case of a general ergodic algebra. To overcome this difficulty, we make essential use of the concept of two-scale Young measures for algebras with mean value, associated with uniformly bounded sequences in $L^2$.

Online Matching with Stochastic Rewards

Series
Graph Theory Seminar
Time
Tuesday, February 19, 2013 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Debmalya PanigrahiDuke University
The online matching problem has received significant attention in recent years because of its connections to allocation problems in internet advertising, crowd sourcing, etc. In these real-world applications, the typical goal is not to maximize the number of allocations; rather it is to maximize the number of “successful” allocations, where success of an allocation is governed by a stochastic event that comes after the allocation. These applications motivate us to introduce stochastic rewards in the online matching problem. In this talk, I will formally define this problem, point out its connections to previously studied allocation problems, give a deterministic algorithm that is close to optimal in its competitive ratio, and describe some directions of future research in this line of work. (Based on joint work with Aranyak Mehta.)

Modeling the Electrical Activity in Cardiac Tissue

Series
Job Candidate Talk
Time
Tuesday, February 19, 2013 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 06
Speaker
Joyce T. Lin Univ of Utah
Electrical stimulation of cardiac cells causes an action potential wave to propagate through myocardial tissue, resulting in muscular contraction and pumping blood through the body. Approximately two thirds of unexpected, sudden cardiac deaths, presumably due to ventricular arrhythmias, occur without recognition of cardiac disease. While conduction failure has been linked to arrhythmia, the major players in conduction have yet to be well established. Additionally, recent experimental studies have shown that ephaptic coupling, or field effects, occurring in microdomains may be another method of communication between cardiac cells, bringing into question the classic understanding that action potential propagation occurs primarily through gap junctions. In this talk, I will introduce the mechanisms behind cardiac conduction, give an overview of previously studied models, and present and discuss results from a new model for the electrical activity in cardiac cells with simplifications that afford more efficient numerical simulation, yet capture complex cellular geometry and spatial inhomogeneities that are critical to ephaptic coupling.

Markov bases: discussion

Series
Other Talks
Time
Monday, February 18, 2013 - 17:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Pedro Rangel, Luo Ye, Robert KroneGeorgia Tech
We will discuss the details of the Markov bases chapter not covered in the previous talks.(Algebraic statistics reading seminar)

Log concavity of characteristic polynomials and tropical intersection theory

Series
Algebra Seminar
Time
Monday, February 18, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Eric KatzWaterloo
In a recent work with June Huh, we proved the log-concavity of the characteristic polynomial of a realizable matroid by relating its coefficients to intersection numbers on an algebraic variety and applying an algebraic geometric inequality. This extended earlier work of Huh which resolved a long-standing conjecture in graph theory. In this talk, we rephrase the problem in terms of more familiar algebraic geometry, outline the proof, and discuss an approach to extending this proof to all matroids. Our approach suggests a general theory of positivity in tropical geometry.

Higher order Markov random fields for independent sets

Series
Combinatorics Seminar
Time
Friday, February 15, 2013 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
David GoldbergISyE, Georgia Tech
We consider higher order Markov random fields to study independent sets in regular graphs of large girth (i.e. Bethe lattice, Cayley tree). We give sufficient conditions for a second-order homogenous isotropic Markov random field to exhibit long-range boundary independence (i.e. decay of correlations, unique infinite-volume Gibbs measure), and give both necessary and sufficient conditions when the relevant clique potentials of the corresponding Gibbs measure satisfy a log-convexity assumption. We gain further insight into this characterization by interpreting our model as a multi-dimensional perturbation of the hardcore model, and (under a convexity assumption) give a simple polyhedral characterization for those perturbations (around the well-studied critical activity of the hardcore model) which maintain long-range boundary independence. After identifying several features of this polyhedron, we also characterize (again as a polyhedral set) how one can change the occupancy probabilities through such a perturbation. We then use linear programming to analyze the properties of this set of attainable probabilities, showing that although one cannot acheive denser independent sets, it is possible to optimize the number of excluded nodes which are adjacent to no included nodes.

Courtesy Listing: Large-Scale Numerical Linear Algebra Techniques for Big Data Analysis

Series
Other Talks
Time
Friday, February 15, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Klaus 2443
Speaker
Jie ChenArgonne National Laboratory

Please Note: Hosted by the School of Computational Science and Engineering

As the term "big data'' appears more and more frequently in our daily life and research activities, it changes our knowledge of how large the scale of the data can be and challenges the application of numerical analysis for performing statistical calculations. In this talk, I will focus on two basic statistics problems sampling a multivariate normal distribution and maximum likelihood estimation and illustrate the scalability issue that dense numerical linear algebra techniques are facing. The large-scale challenge motivates us to develop scalable methods for dense matrices, commonly seen in statistical analysis. I will present several recent developments on the computations of matrix functions and on the solution of a linear system of equations, where the matrices therein are large-scale, fully dense, but structured. The driving ideas of these developments are the exploration of the structures and the use of fast matrix-vector multiplications to reduce the general quadratic cost in storage and cubic cost in computation. "Big data'' offers a fresh opportunity for numerical analysts to develop algorithms with a central goal of scalability in mind. It also brings in a new stream of requests to high performance computing for highly parallel codes accompanied with the development of numerical algorithms. Scalable and parallelizable methods are key for convincing statisticians and practitioners to apply the powerful statistical theories on large-scale data that they currently feel uncomfortable to handle.

Conormals and contact homology V

Series
Geometry Topology Working Seminar
Time
Friday, February 15, 2013 - 11:30 for 1.5 hours (actually 80 minutes)
Location
Skiles 006
Speaker
John EtnyreGa Tech
In this series of talks I will begin by discussing the idea of studying smooth manifolds and their submanifolds using the symplectic (and contact) geometry of their cotangent bundles. I will then discuss Legendrian contact homology, a powerful invariant of Legendrian submanifolds of contact manifolds. After discussing the theory of contact homology, examples and useful computational techniques, I will combine this with the conormal discussion to define Knot Contact Homology and discuss its many wonders properties and conjectures concerning its connection to other invariants of knots in S^3.

Pages