Seminars and Colloquia by Series

New ways to approach contagion spreading and node ranking

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 24, 2014 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Seth MarvelUniversity of Michigan
In this talk, I will present work on two very different problems, with the only common theme being a substantial departure from standard approaches. In the first part, I will discuss how the spread of many common contagions may be more accurately modeled with nonlocal approaches than with the current standard of local approaches, and I will provide a minimal mathematical foundation showing how this can be done. In the second part, I will present a new computational method for ranking items given only a set of pairwise preferences between them. (This is known as the minimum feedback arc set problem in computer science.) For a broad range of cases, this method appears to beat the current "world record" in both run time and quality of solution.

Some Recent Results for Coupled Systems on Networks

Series
CDSNS Colloquium
Time
Monday, March 24, 2014 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Professor Michael LiUniveristy of Alberta
Many complex models from science and engineering can be studied in the framework of coupled systems of differential equations on networks. A network is given by a directed graph. A local system is defined on each vertex, and directed edges represent couplings among vertex systems. Questions such as stability in the large, synchronization, and complexity in terms of dynamic clusters are of interest. A more recent approach is to investigate the connections between network topology and dynamical behaviours. I will present some recent results on the construction of global Lyapunov functions for coupled systems on networks using a graph theoretic approach, and show how such a construction can help us to establish global behaviours of compelx models.

Approximate well-supported Nash equilibria for win-lose games

Series
Combinatorics Seminar
Time
Friday, March 14, 2014 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sergey NorinMcGill University
We will explain the concept of aproximate well-supported Nash equilibrium and show that one must consider equilibria with large supports to achieve good approximation ratio. Our arguments use tools from probabilistic, extremal and additive combinatorics. Joint work with Y. Anbalagan, R. Savani and A. Vetta.

Topics in Ergodic Theory III: Entropy.

Series
Dynamical Systems Working Seminar
Time
Friday, March 14, 2014 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Lei ZhangGeorgia Institute of Technology
We introduce concepts of entropy and methods of calculation of entropy and examples. This is part of a reading seminar geared towards understanding of Smooth Ergodic Theory. (The study of dynamical systems using at the same time tools from measure theory and from differential geometry)It should be accesible to graduate students and the presentation is informal. The first goal will be a proof of the Oseledets multiplicative ergodic theorem for random matrices. Then, we will try to cover the Pesin entropy formula, invariant manifolds, etc.

Symmetry, Isotopy, and Irregular Covers

Series
Dissertation Defense
Time
Friday, March 14, 2014 - 10:30 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Rebecca R. WinarskiGeorgia Tech
We say that a cover of surfaces S-> X has the Birman--Hilden property if the subgroup of the mapping class group of X consisting of mapping classes that have representatives that lift to S embeds in the mapping class group of S modulo the group of deck transformations. We identify one necessary condition and one sufficient condition for when a cover has this property. We give new explicit examples of irregular branched covers that do not satisfy the necessary condition as well as explicit covers that satisfy the sufficient condition. Our criteria are conditions on simple closed curves, and our proofs use the combinatorial topology of curves on surfaces.

Beurling's Theorem

Series
Analysis Working Seminar
Time
Friday, March 14, 2014 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Robert RahmSchool of Math
Robert will be talking and leading the discussion on Chapter 2 Section 7 of Bounded Analytic Functions: Beurling's Theorem.

Large deviations and Monte Carlo methods for problems with multiple scales

Series
Stochastics Seminar
Time
Thursday, March 13, 2014 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Konstantinos SpiliopoulosBoston University
Rare events, metastability and Monte Carlo methods for stochastic dynamical systems have been of central scientific interest for many years now. In this talk we focus on multiscale systems that can exhibit metastable behavior, such as rough energy landscapes. We discuss quenched large deviations in related random rough environments and design of provably efficient Monte Carlo methods, such as importance sampling, in order to estimate probabilities of rare events. Depending on the type of interaction of the fast scales with the strength of the noise we get different behavior, both for the large deviations and for the corresponding Monte Carlo methods. Standard Monte Carlo methods perform poorly in these kind of problems in the small noise limit. In the presence of multiple scales one faces additional difficulties and straightforward adaptation of importance sampling schemes for standard small noise diffusions will not produce efficient schemes. We resolve this issue and demonstrate the theoretical results by examples and simulation studies.

On the directed cycle double cover conjecture

Series
Graph Theory Seminar
Time
Thursday, March 13, 2014 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Andrea JimenezUniversity of Sao Paulo and Math, GT
In this talk, we discuss our recent progress on the famous directed cycle double cover conjecture of Jaeger. This conjecture asserts that every 2-connected graph admits a collection of cycles such that each edge is in exactly two cycles of the collection. In addition, it must be possible to prescribe an orientation to each cycle so that each edge is traversed in both ways. We plan to define the class of weakly robust trigraphs and prove that a connectivity augmentation conjecture for this class implies general directed cycle double cover conjecture. This is joint work with Martin Loebl.

The essential skeleton of a degeneration of algebraic varieties

Series
Algebra Seminar
Time
Wednesday, March 12, 2014 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Johannes NicaiseKU Leuven
I will explain the construction of the essential skeleton of a one-parameter degeneration of algebraic varieties, which is a simplicial space encoding the geometry of the degeneration, and I will prove that it coincides with the skeleton of a good minimal dlt-model of the degeneration if the relative canonical sheaf is semi-ample. These results, contained in joint work with Mircea Mustata and Chenyang Xu, provide some interesting connections between Berkovich geometry and the Minimal Model Program.

Pages