### An Elementary Proof of the Gaussian Concentration Inequality

- Series
- Probability Working Seminar
- Time
- Friday, October 3, 2008 - 15:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 168
- Speaker
- Christian Houdre – School of Mathematics, Georgia Tech

- You are here:
- GT Home
- Home
- News & Events

- Series
- Probability Working Seminar
- Time
- Friday, October 3, 2008 - 15:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 168
- Speaker
- Christian Houdre – School of Mathematics, Georgia Tech

- Series
- Geometry Topology Seminar
- Time
- Friday, October 3, 2008 - 14:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 269
- Speaker
- Tony Pantev – Dept of Mathematics, University of Penn

I will describe a framework which relates large N duality to the geometry of degenerating Calabi-Yau spaces and the Hitchin integrable system. I will give a geometric interpretation of the Dijkgraaf-Vafa large N quantization procedure in this context.

- Series
- Stochastics Seminar
- Time
- Thursday, October 2, 2008 - 15:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 269
- Speaker
- Mark Huber – Departments of Mathematics and Statistical Sciences, Duke University

Spatial data are often more dispersed than would be expected if the points were independently placed. Such data can be modeled with repulsive point processes, where the points appear as if they are repelling one another. Various models have been created to deal with this phenomenon. Matern created three algorithms that generate repulsive processes. Here, MatÃ©rn Type III processes are used to approximate the likelihood and posterior values for data. Perfect simulation methods are used to draw auxiliary variables for each spatial point that are part of the type III process.

- Series
- School of Mathematics Colloquium
- Time
- Thursday, October 2, 2008 - 11:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 269
- Speaker
- John Etnyre – School of Mathematics, Georgia Tech

Describe the trajectories of particles floating in a liquid. This is a surprisingly difficult problem and attempts to understand it have involved many diverse techniques. In the 60's Arold, Marsden, Ebin and others began to introduce topological techniques into the study of fluid flows. In this talk we will discuss some of these ideas and see how they naturally lead to the introduction of contact geometry into the study of fluid flows. We then consider some of the results one can obtain from this contact geometry perspective. For example we will show that for a sufficiently smooth steady ideal fluid flowing in the three sphere there is always some particle whose trajectory is a closed loop that bounds an embedded disk, and that (generically) certain steady Euler flows are (linearly) unstable.

- Series
- School of Mathematics Colloquium
- Time
- Thursday, October 2, 2008 - 11:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 269
- Speaker
- John Etnyre – School of Mathematics, Georgia Tech

Describe the trajectories of particles floating in a liquid. This is a surprisingly difficult problem and attempts to understand it have involved many diverse techniques. In the 60's Arold, Marsden, Ebin and others began to introduce topological techniques into the study of fluid flows. In this talk we will discuss some of these ideas and see how they naturally lead to the introduction of contact geometry into the study of fluid flows. We then consider some of the results one can obtain from this contact geometry perspective. For example we will show that for a sufficiently smooth steady ideal fluid flowing in the three sphere there is always some particle whose trajectory is a closed loop that bounds an embedded disk, and that (generically) certain steady Euler flows are (linearly) unstable.

- Series
- ACO Student Seminar
- Time
- Wednesday, October 1, 2008 - 13:30 for 2 hours
- Location
- ISyE Executive Classroom
- Speaker
- Daniel Dadush – ACO, Georgia Tech

Constraint Programming is a powerful technique developed by the Computer Science community to solve combinatorial problems. I will present the model, explain constraint propagation and arc consistency, and give some basic search heuristics. I will also go through some illustrative examples to show the solution process works.

- Series
- Research Horizons Seminar
- Time
- Wednesday, October 1, 2008 - 12:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 255
- Speaker
- Roland van der Veen – University of Amsterdam

In this introduction to knot theory we will focus on a class of knots called rational knots. Here the word rational refers to a beautiful theorem by J. Conway that sets up a one to one correspondence between these knots and the rational numbers using continued fractions. We aim to give an elementary proof of Conway's theorem and discuss its application to the study of DNA recombination. No knowledge of topology is assumed.

- Series
- Mathematical Biology Seminar
- Time
- Wednesday, October 1, 2008 - 11:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 255
- Speaker
- John Drake – UGA

- Series
- PDE Seminar
- Time
- Tuesday, September 30, 2008 - 15:15 for 1.5 hours (actually 80 minutes)
- Location
- Skiles 255
- Speaker
- Marian Bocea – North Dakota State University, Fargo

The yield set of a polycrystal may be characterized using variational principles associated to suitable supremal functionals. I will describe some model problems for which these can be obtained via Gamma-convergence of a class of "power-law" functionals acting on fields satisfying appropriate differential constraints, and I will indicate some PDEs which play a role in the analysis of these problems.

- Series
- Analysis Seminar
- Time
- Monday, September 29, 2008 - 14:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 255
- Speaker
- Wing Suet Li – School of Mathematics, Georgia Tech

The Horn inequalities give a characterization of eigenvalues of self-adjoint n by n matrices A, B, C with A+B+C=0. The proof requires powerful tools from algebraic geometry. In this talk I will talk about our recent result of these inequalities that are indeed valid for self-adjoint operators of an arbitrary finite factors. Since in this setting there is no readily available machinery from algebraic geometry, we are forced to look for an analysts friendly proof. A (complete) matricial form of our result is known to imply an affirmative answer to the Connes' embedding problem. Geometers especially welcome!

- Offices & Departments
- News Center
- Campus Calendar
- Special Events
- GreenBuzz
- Institute Communications
- Visitor Resources
- Campus Visits
- Directions to Campus
- Visitor Parking Information
- GTvisitor Wireless Network Information
- Georgia Tech Global Learning Center
- Georgia Tech Hotel & Conference Center
- Barnes & Noble at Georgia Tech
- Ferst Center for the Arts
- Robert C. Williams Paper Museum