Past Events

Let G=(V,E) be an undirected graph on n vertices and λ:E →2^N a mapping that assigns to every edge a non-empty set of positive integer labels. These labels can be seen as discrete times when the edge is present. Such a labeled graph G'=(G,λ) is said...

Regularity has long been known to fail for minimal submanifolds of Euclidean space with large dimension, or large codimension, the latter in part because of no maximum principle for systems of PDEs. If, however, a minimal submanifold of Euclidean 2n...

Superprocesses are measure-valued Markov processes describing the evolution of populations undergoing random spatial motion and independent branching (reproduction). In this talk I will discuss the dual relationship of superprocesses with certain...

Degenerate random environments (DRE) are a class of models of random media that arise naturally when considering random walks in non-elliptic random environments. In this talk we will motivate and introduce this class of models, discuss percolation...

In vector-borne epidemic models there is often a substantial difference between the vector (usually insects) and host (usually humans) time scales. This makes it possible to view the model as a singular perturbation problem and use the quasi-steady...

Integer programming is one of the most fundamental problems in discrete optimization. While integer programming is computationally hard in general, there exist efficient algorithms for special instances. In particular, integer programming is fixed...

Over the past few decades, a lot of attention has been drawn to large-scale streaming data analysis, where researchers are faced with huge amount of high-dimensional data acquired in a stream fashion. In this case, conventional algorithms that...

In this second part of our exposition on the joints problem we showcase Yu and Zhao’s `Joints tightened’. This exciting application of the polynomial method has resulted in a rare occurrence in incidence geometry; the exact constant has been...