SEPTEMBER |
|
| PACM Seminar *** Please note special time and location | |
| Topic: | Old Problems and New Results in Coding Theory |
| Presenter: | Alexander Vardy, University of California, San Diego |
| Date: | Monday, September 13, 2004, Time: 2:00 p.m., Location: Joseph Henry Room, Jadwin Hall |
| Abstract: | Coding theory was born in 1948 with the work of Claude Shannon, who proved that for every information rate $R$ up to channel capacity, there exists a code of rate $R$ that guarantees a vanishing probability of decoding error. Shannon, however, did not tell us how to find such codes nor how to decode them. It was recognized early on that codes with good Hamming distance can correct many errors, while codes endowed with algebraic structure admit efficient algebraic decoding algorithms. This has led to over 50 years of research in algebraic and combinatorial coding theory. We will survey several key problems and new results in this area. In particular, we'll elaborate upon a new asymptotic improvement of the Gilbert-Varshamov bound and upon recent methods for decoding Reed-Solomon codes using bivariate polynomial interpolation. About 10 years ago, the field of coding theory was transformed by the discovery of codes defined on certain graphs, with no algebraic structure, that perform extremely close to the Shannon capacity under probabilistic message-passing decoding. We will briefly review this exciting development, and point out the challenges that lie ahead in the area of "probabilistic" coding theory. |
| Discrete Mathematics Seminar | |
| Topic: | Co-degree density of hypergraphs |
| Presenter: | Yi Zhao, University of Illinois at Chicago |
| Date: | Wednesday, September 15, 2004, Time: 2:30 p.m., Location: Fine Hall 224 |
| Abstract: | Click here |
| Topology Seminar | |
| Topic: | TBA |
| Presenter: | Paolo Lisca, Pisa |
| Date: | Thursday, September 16, 2004, Time: 4:30 p.m., Location: Fine Hall 314 |
| Algebraic Geometry Seminar | |
| Topic: | Three-fold divisorial contractions |
| Presenter: | Masayuki Kawakita, RIMS/IAS |
| Date: | Tuesday, September 21, 2004, Time: 4:30 p.m., Location: Fine Hall 322 |
| Statistical Mechanics Seminar | |
| Topic: | Realizability and Superhomogeneity |
| Presenter: | J. Lebowitz, Rutgers University |
| Date: | Wednesday, September 22, 2004, Time: 2:00 p.m., Location: Jadwin 343 |
| Abstract: | I will discuss conditions for the existence of a point process, i.e. particle distribution, in R^d with a specified density and pair correlation. I will also discuss point processes for which the variance grows slower than the volume. |
| Discrete Mathematics Seminar | |
| Topic: | Menger Theorem for infinite graphs |
| Presenter: | Eli Berger, IAS |
| Date: | Wednesday, September 22, 2004, Time: 2:30 p.m., Location: Fine Hall 224 |
| Abstract: | Click here |
| PACM Seminar | |
| Topic: | Internet Topology Modeling and the Role of Design |
| Presenter: | Walter Willenger, AT&T Labs Research |
| Date: | Monday, September 27, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: | The assumption that the Internet has become sufficiently large-scale and homogeneous to be amenable to statistical physics-inspired analysis techniques has recently led to the popular "scale-free" models of Internet topology, which are claimed to explain, for example, the structure of the Internet's router-level connectivity graph by simple random processes that are void of any engineering tradeoffs. An alternative perspective, motivated by engineering, suggests that nonrandom design rather than randomness plays a primary role in the construction and evolution of complex systems, and the complex structure of highly engineered technology and of biological systems is viewed as the natural by-product of Highly Optimized Tradeoffs (HOT) between system-specific objectives and constraints. This talk shows how and why the latter view, when applied to the study of router-level Internet connectivity, results in conclusions that are fully consistent with the real Internet, but are the exact opposite of what the scale-free models claim. The reasons for reaching such divergent conclusions about one and the same system go well beyond the Internet and scale-free models and are endemic in the application of ideas from statistical physics to problems in technology and biology, where it is assumed that the details related to a complex system's design, functionality, constraints, and evolution (i.e., all ingredients that make engineering and biology different from physics) can be safely ignored in favor of random ensembles and their emergent properties. |
| Discrete Mathematics Seminar | |
| Topic: | Pfaffian labellings and signs of edge coloring |
| Presenter: | Serguei Norine, Georgia Institute of Technology |
| Date: | Wednesday, September 29, 2004, Time: 2:30 p.m., Location: Fine Hall 224 |
| Abstract: | Click here |
OCTOBER |
|
| PACM Seminar | |
| Topic: | What's Applied and Computational Math Got to Do with High-Performance Nano-Composites? |
| Presenter: | Greg Forest, Institute for Advanced Materials, NanoScience and Technology, University of North Carolina, Chapel Hill |
| Date: | Monday, October 4, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: | Nano-composite materials of interest for this lecture consist of high aspect ratio, spheroidal macromolecules, known as "nematic polymers", in a traditional polymer matrix. Rod-like, tube-like, and platelet molecules are added to traditional polymeric materials to enhance a variety of properties, from thermal or electrical conductivities to barrier and mechanical properties. There is no direct theoretical prediction that begins with the composition of nano-inclusions and matrix, tracks the flow into films, fibers, or molded parts, and then infers the effective properties of the composite. Each stage is a mathematical theory, modeling, and simulation challenge; modeling the entire nano-composite pipeline is a conceivable target. Progress and open problems that remain will be discussed, aimed at the graduate students in the Program. |
| Algebraic Geometry Seminar | |
| Topic: | Curve correspondences |
| Presenter: | Yuri Tschinkel, Uni. Goettingen |
| Date: | Tuesday, October 5, 2004, Time: 4:30 p.m., Location: Fine Hall 322 |
| PACM Seminar | |
| Topic: | Optimal decisions: From neural spikes, through stochastic differential equations, to behavior |
| Presenter: | Philip Holmes, PACM, MAE & CSBMB, Princeton University |
| Date: | Monday, October 11, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: | There is increasing evidence from in vivo recordings in monkeys trained to respond to stimuli by making left- or rightward eye movements, that firing rates in certain groups of `visual' neurons mimic drift-diffusion processes, rising to a (fixed) threshold prior to movement initiation. This supplements earlier observations of psychologists, that human reaction time and error rate data can be fitted by random walk and diffusion models, and has renewed interest in optimal decision-making ideas from information theory and statistical decision theory as a clue to neural mechanisms. I will review some results from decision theory and stochastic ordinary differential equations, and show how they may be extended and applied to derive explicit parameter dependencies in optimal performance that may be tested on human and animal subjects. I will then describe a biophysically-based model of a pool of neurons in a brainstem organ - locus coeruleus - that is implicated in widespread norepinephrine release. This neurotransmitter can effect transient gain and response threshold changes in cortical circuits of the type that the abstract drift-diffusion analysis requires. I will argue that, in spite of many gaps and leaps of faith, a rational account of how neural spikes give rise to simple behaviors is beginning to emerge. This work is in collaboration with Eric Brown, Rafal Bogacz, Jeff Moehlis and Jonathan Cohen (Princeton University), and Ed Clayton, Janusz Rajkowski and Gary Aston-Jones (University of Pennsylvania). It is supported by the National Institutes of Mental Health. |
| Statistical Mechanics Seminar | |
| Topic: | TBA |
| Presenter: | G. Gallavotti, University of Rome |
| Date: | Wednesday, October 13, 2004, Time: 2:00 p.m., Location: Jadwin 343 |
| PACM Seminar | |
| Topic: | PlanetLab |
| Presenter: | Larry Peterson, Department of Computer Science, Princeton University |
| Date: | Monday, October 18, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Statistical Mechanics Seminar | |
| Topic: | TBA |
| Presenter: | H-T. Yau, Stanford University |
| Date: | Wednesday, October 20, 2004, Time: 2:00 p.m., Location: Jadwin 343 |
NOVEMBER |
|
| PACM Seminar | |
| Topic: | No Equations |
| Presenter: | Ioannis Kevrekidis, Department of Chemical Engineering, Princeton University |
| Date: | Monday, November 1, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| PACM Seminar | |
| Topic: | Multiscale Analysis and Diffusion Geometries on Digital Data Sets |
| Presenter: | Ronald Coifman, Department of Mathematics, Yale University |
| Date: | Monday, November 8, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: | We will discuss simple methodologies for analyzing and discovering geometric structures in massive data sets. We introduce multiscale Harmonic analysis on graphs and on subsets of Euclidean spaces. The methods augment spectral graph theory, kernel principal component analysis, manifold learning and other methods from machine learning. |
| PACM Seminar | |
| Topic: | Astrophysical Gas Dynamics |
| Presenter: | Jim Stone, Department of Astrophysical Sciences, Princeton University |
| Date: | Monday, November 15, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| PACM Seminar | |
| Topic: | Qualitative/Quantitative Analysis of a Class of Biological Networks |
| Presenter: | Eduardo Sontag, Department of Math and BioMaPS Institute for Quantitative Biology, Rutgers University |
| Date: | Monday, November 22, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
| Abstract: | The analysis of signaling networks constitutes one of the central questions in systems biology: there is an pressing need for powerful mathematical tools to help understand, quantify, and conceptualize their information processing and dynamic properties. Approaches based upon detailed modeling and simulation are hampered by the fact that is virtually impossible to experimentally validate the form of the nonlinearities used in reaction terms, or, even when such forms are known, to accurately estimate coefficients (parameters). In this presentation, we show how some signaling systems may be profitably studied by first decomposing them into several subsystems, each of which is endowed with certain "qualitative" mathematical properties. These properties, in conjunction with a relatively small amount of "quantitative" data, allow the behavior of the entire, reconstituted system, to be deduced from the behavior of its parts. This novel approach emerged originally from our study of possible multi-stability or oscillations in feedback loops in cell signal transduction modeling, but turns out to be of more general applicability. (Most of the work reported in this talk was carried out in collaboration with D. Angeli, and parts of it with J. Ferrell, G. Enciso, and P. de Leenheer.) |
| Statistical Mechanics Seminar | |
| Topic: | Linear response far from equilibrium |
| Presenter: | D. Ruelle, IHES |
| Date: | Wednesday, November 24, 2004, Time: 2:00 p.m., Location: Jadwin 343 |
| PACM Seminar | |
| Topic: | TBA |
| Presenter: | Jelena Kovacevic, Center for BioImage Informatics, Carnegie Mellon University |
| Date: | Monday, November 29, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |
DECEMBER |
|
| PACM Seminar | |
| Topic: | Approximating Quantum Mechanics |
| Presenter: | Emily Carter, Department of Mechanical & Aerospace Engineering, Princeton University |
| Date: | Monday, December 6, 2004, Time: 4:00 p.m., Location: Fine Hall 214 |