James Nolen : Reaction-Diffusion Fronts in Heterogeneous Media
- Presentations ( 145 Views )Reaction-diffusion equations are used in mathematical models of many physical and biological phenomena involving front propagation and pulse propagation. How do variations in the environment effect these phenomena? In this seminar, I will describe recent progress in understanding how fronts propagate in heterogeneous media. In particular, I will describe properties of generalized traveling waves for one-dimensional reaction-diffusion equations with variable excitation. I also will discuss multi-dimensional fronts in stationary random media, a model relevant to premixed-turbulent combustion. Along the way, I plan to describe interesting topics for future research.
Ben Weinkove : Symplectic forms, Kahler metrics and the Calabi-Yau equation
- Presentations ( 158 Views )Yau's theorem on Kahler manifolds states that there exists a unique Kahler metric in every Kahler class with prescribed volume form. This has many applications in complex geometry. I will discuss symplectic manifolds. In a different direction, I will talk about the problem of existence of constant scalar curvature Kahler metrics, which can also be considered a generalization of Yau's theorem.
Robert Ghrist : Sheaves and Sensors
- Presentations ( 208 Views )This work is motivated by a fundamental problem in sensor networks -- the need to aggregate redundant sensor data across a network. We focus on a simple problem of enumerating targets with a network of sensors that can detect nearby targets, but cannot identify or localize them. We show a clear, clean relationship between this problem and the topology of constructable sheaves. In particular, an integration theory from sheaf theory that uses Euler characteristic as a measure provides a computable, robust, and powerful tool for data aggregation.
Roman Vershynin : Randomness in functional analysis: towards universality
- Presentations ( 157 Views )The probabilistic method has redefined functional analysis in high dimensions. Random spaces and operators are to analysis what random graphs are to combinatorics. They provide a wealth of examples that are otherwise hard to construct, suggest what situations we should view as typical, and they have far-reaching applications, most notably in convex geometry and computer science. With the increase of our knowledge about random structures we begin to wonder about their universality. Is there a limiting picture as the dimension increases to infinity? Is this picture unique and independent of the distribution? What are deterministic implications of probabilistic methods? This talk will survey progress on some of these problems, in particular a proof of the conjecture of Von Neumann and Goldstine on random operators and connections to the Littlewood-Offord problem in additive combinatorics.
Nicholas Eriksson : Combinatorial methods in evolutionary biology
- Presentations ( 152 Views )My research focuses in three areas of evolutionary biology: the structure of viral populations, the evolution of drug resistance, and phylogenetics. Knowledge of the diversity of viral populations is important for understanding disease progression, vaccine design, and drug resistance, yet it is poorly understood. New technologies (pyrosequencing) allow us to read short, error-prone DNA sequences from an entire population at once. I will show how to assemble the reads into genomes using graph theory, allowing us to determine the population structure. Next, I will describe a new class of graphical models inspired by poset theory that describe the accumulation of (genetic) events with constraints on the order of occurrence. Applications of these models include calculating the risk of drug resistance in HIV and understanding cancer progression. Finally, I'll describe a polyhedral method for determining the sensitivity of phylogenetic algorithms to changes in the parameters. We will analyze several datasets where small changes in parameters lead to completely different trees and see how discrete geometry can be used to average out the uncertainty in parameter choice.
Matthias Heymann : Computing maximum likelihood paths of rare transition events, and applications to synthetic biology
- Presentations ( 163 Views )Dynamical systems with small noise (e.g. SDEs) allow for rare transitions from one stable state into another that would not be possible without the presence of noise. Large deviation theory provides the means to analyze both the frequency of these transitions and the maximum likelihood transition path. The key object for the determination of both is the quasipotential, V(x,y) = inf S_T(phi), where S_T(phi) is the action functional associated to the system, and where the infimum is taken over all T>0 and all paths phi:[0,T]->R^n leading from x to y. The numerical evaluation of V(x,y) however is made difficult by the fact that in most cases of interest no minimizer exists.
In my work I prove an alternative geometric formulation of V(x,y) that resolves this issue by introducing an action on the space of curves ( i.e. this action is independent of the parametrization of phi). In this formulation, a minimizer exists, and we use it to build a flexible algorithm (the geometric minimum action method, gMAM) for finding the maximum likelihood transition curve.
In one application I show how the gMAM can be useful in the newly emerging field of synthetic biology: We propose a method to identify the sources of instabilities in (genetic) networks.
This work was done in collaboration with my adviser Eric Vanden-Eijnden and is the core of my PhD thesis at NYU.
Laura DeMarco : Complex dynamics and potential theory
- Presentations ( 154 Views )I will begin with the basics of the two subjects, with the goal of explaining how each has been used as a method to obtain results in the other. The first half will be devoted to foundational results, dating to the 1930s for potential theory and the 1980s for complex dynamics. The second half will be devoted to more recent developments.
Ravi Vakil : Murphys Law in algebraic geometry: Badly-behaved moduli spaces
- Presentations ( 167 Views )We consider the question: ``How bad can the deformation space of an object be?'' (Alternatively: ``What singularities can appear on a moduli space?'') The answer seems to be: ``Unless there is some a priori reason otherwise, the deformation space can be arbitrarily bad.'' We show this for a number of important moduli spaces. More precisely, up to smooth parameters, every singularity that can be described by equations with integer coefficients appears on moduli spaces parameterizing: smooth projective surfaces (or higher-dimensional manifolds); smooth curves in projective space (the space of stable maps, or the Hilbert scheme); plane curves with nodes and cusps; stable sheaves; isolated threefold singularities; and more. The objects themselves are not pathological, and are in fact as nice as can be. This justifies Mumford's philosophy that even moduli spaces of well-behaved objects should be arbitrarily bad unless there is an a priori reason otherwise. I will begin by telling you what ``moduli spaces'' and ``deformation spaces'' are. The complex-minded listener can work in the holomorphic category; the arithmetic listener can think in mixed or positive characteristic. This talk is intended to be (mostly) comprehensible to a broad audience.