Friday, October 23, 2009
From transfinite diameter to order-density to best-packing: the asymptotics of ground state configurations
Fri, 10/23/2009 - 2:00pm, Skiles 269
Doug Hardin, Vanderbilt University Organizer: Jeff Geronimo
I will review recent and classical results concerning the asymptotic properties (as N --> \infty) of 'ground state' configurations of N particles restricted to a d-dimensional compact set A\subset {\bf R}^p that minimize the Riesz s-energy functional \sum_{i\neq j}\frac{1}{|x_{i}-x_{j}|^{s}} for s>0. Specifically, we will discuss the following (1) For s < d, the ground state configurations have limit distribution as N --> \infty given by the equilibrium measure \mu_s, while the first order asymptotic growth of the energy of these configurations is given by the 'transfinite diameter' of A. (2) We study the behavior of \mu_s as s approaches the critical value d (for s\ge d, there is no equilibrium measure). In the case that A is a fractal, the notion of 'order two density' introduced by Bedford and Fisher naturally arises. This is joint work with M. Calef. (3) As s --> \infty, ground state configurations approach best-packing configurations on A. In work with S. Borodachov and E. Saff we show that such configurations are asymptotically uniformly distributed on A.
Geometry Topology Working Seminar: Introduction to Heegaard Floer Homology
Fri, 10/23/2009 - 3:00pm, Skiles 269
Amey Kaloti, Georgia Tech Organizer: Meredith Casey
Abstract: Heegaard floer homology is an invariant of closed 3 manifolds defined by Peter Ozsvath and Zoltan Szabo. It has proven to be a very strong invariant of 3 manifolds with connections to contact topology. In these talks we will try to define the Heegaard Floer homology without assuming much background in low dimensional topology. One more goal is to present the combinatorial description for this theory.
This is a 2 hour talk.
Random regular graphs: from spectrum to geometry and back
Fri, 10/23/2009 - 3:05pm, Skiles 255
Eyal Lubetzky, Microsoft Research, Redmond, WA Organizer: Prasad Tetali
The class of random regular graphs has been the focus of extensive study highlighting the excellent expansion properties of its typical instance. For instance, it is well known that almost every regular graph of fixed degree is essentially Ramanujan, and understanding this class of graphs sheds light on the general behavior of expanders. In this talk we will present several recent results on random regular graphs, focusing on the interplay between their spectrum and geometry. We will first discuss the relation between spectral properties and the abrupt convergence of the simple random walk to equilibrium, derived from precise asymptotics of the number of paths between vertices. Following the study of the graph geometry we proceed to its random perturbation via exponential weights on the edges (first-passage-percolation). We then show how this allows the derivation of various properties of the classical Erd\H{o}s-R\'enyi random graph near criticality. Finally, returning to the spectrum of random regular graph, we discuss the question of how close they really are to being Ramanujan and conclude with related problems involving random matrices. Based on joint works with Jian Ding, Jeong Han Kim and Yuval Peres, with Allan Sly and with Benny Sudakov and Van Vu.
Probability Working Seminar: Localization for a random walk in random potential
Fri, 10/23/2009 - 4:00pm, Skiles 154
Tobias Hurth, Georgia Tech Organizer: Yuri Bakhtin
The talk is based on a 1992 paper by Yakov Sinai. He proves a localization property for random walks in the random potential known as Nechaev's model.
Saturday, October 24, 2009
Theory Day Speaker 1 - What Makes an Algorithm Great?
Sat, 10/24/2009 - 12:30pm, LeCraw Auditorium
Richard Karp, Electrical Engineering and Computer Sciences, University of California, Berkeley Organizer: Robin Thomas
From time to time a new algorithm comes along that causes a sensation in theoretical computer science or in an area of application because of its resolution of a long-standing open question, its surprising efficiency, its practical usefulness, the novelty of its setting or approach, the elegance of its structure, the subtlety of its analysis or its range of applications. We will give examples of algorithms that qualify for greatness for one or more of these reasons, and discuss how to equip students to appreciate them and understand their strengths and weaknesses.
Theory Day Speaker 2 - Computational Aspects of Equilibria
Sat, 10/24/2009 - 1:50pm, LeCraw Auditorium
Mihalis Yannakakis, Computer Science, Columbia University Organizer: Robin Thomas
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; price equilibria in markets; optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysis of the evolution of various types of dynamic stochastic models. It is not known whether these problems can be solved in polynomial time. Despite their broad diversity, there are certain common computational principles that underlie different types of equilibria and connect many of these problems to each other. In this talk we will discuss some of these common principles and the corresponding complexity classes that capture them; the effect on the complexity of the underlying computational framework; and the relationship with other open questions in computation.
Theory Day Speaker 3 - Disjoint paths, isoperimetric problems, and graph eigenvalues
Sat, 10/24/2009 - 3:10pm, LeCraw Auditorium
Noga Alon, Mathematics and Computer Science, Tel Aviv University Organizer: Robin Thomas
The spectral properties of a graph are intimately related to its structure. This can be applied in the study of discrete isoperimetric problems and in the investigation of extremal and algorithmic questions for graphs. I will discuss several recent examples illustrating this theme.
ACO Distinguished Lecture: Can (Theoretical Computer) Science come to grips with Consciousness
Sat, 10/24/2009 - 5:00pm, LeCraw Auditorium, College of Management
Manuel Blum, Computer Science, Carnegie Mellon University Organizer: Robin Thomas
To come to grips with consciousness, I postulate that living entities in general, and human beings in particular, are mechanisms... marvelous mechanisms to be sure but not magical ones... just mechanisms. On this basis, I look to explain some of the paradoxes of consciousness such as Samuel Johnson's "All theory is against the freedom of the will; all experience is for it." I will explain concepts of self-awareness and free will from a mechanistic view. My explanations make use of computer science and suggest why these phenomena would exist even in a completely deterministic world. This is particularly striking for free will. The impressions of our senses, like the sense of the color blue, the sound of a tone, etc. are to be expected of a mechanism with enormously many inputs categorized into similarity classes of sight, sound, etc. Other phenomena such as the "bite" of pain are works in progress. I show the direction that my thinking takes and say something about what I've found and what I'm still looking for. Fortunately, the sciences are discovering a great deal about the brain, and their discoveries help enormously in guiding and verifying the results of this work.
Preceded with a reception at 4:10pm.
Monday, October 26, 2009
Geometry Topology Working Seminar: Introduction to Bordered Heegaard-Floer homology
Mon, 10/26/2009 - 10:00am, Skiles 255
Shea Vela-Vick, Columbia University Organizer: John Etnyre
We will focus on the "toy model" of bordered Floer homology. Loosely speaking, this is bordered Floer homology for grid diagrams of knots. While the toy model unfortunately does not provide us with any knot invariants, it highlights many of the key ideas needed to understand the more general theory. Note the different time and place! This is a 1.5 hour talk.
Applied and Computational Mathematics Seminar: A spectral method with window technique for the initial value problems of the Kadomtsev-Petviashvili equation
Mon, 10/26/2009 - 1:00pm, Skiles 255
Chiu-Yen Kao , Ohio State University (Department of Mathematics), email Organizer: Sung Ha Kang
The Kadomtsev-Petviashvili (KP) equation is a two-dimensional dispersivewave equation which was proposed to study the stability of one solitonsolution of the KdV equation under the influence of weak transversalperturbations. It is well know that some closed-form solutions can beobtained by function which have a Wronskian determinant form. It is ofinterest to study KP with an arbitrary initial condition and see whetherthe solution converges to any closed-form solution asymptotically. Toreveal the answer to this question both numerically and theoretically, weconsider different types of initial conditions, including one-linesoliton, V-shape wave and cross-shape wave, and investigate the behaviorof solutions asymptotically. We provides a detail description ofclassification on the results. The challenge of numerical approach comes from the unbounded domain andunvanished solutions in the infinity. In order to do numerical computationon the finite domain, boundary conditions need to be imposed carefully.Due to the non-periodic boundary conditions, the standard spectral methodwith Fourier methods involving trigonometric polynomials cannot be used.We proposed a new spectral method with a window technique which will makethe boundary condition periodic and allow the usage of the classicalapproach. We demonstrate the robustness and efficiency of our methodsthrough numerous simulations.