Past Events

We consider an aggregation model that consists of an active transport equation for the macroscopic population density, where the velocity has a nonlocal functional dependence on the density, modelled via an interaction potential. We set up the model...

The Wasserstein space, which is the space of probability measures endowed with the so-called (quadratic) Wasserstein distance coming from optimal transport, can formally be seen as a Riemannian manifold of infinite dimension. We propose, through a...

Consider a system of N particles moving according to Brownian motions and branching at rate one. Each time a particle branches, the particle in the system furthest from the origin is killed. It turns out that we can use results about a related...

A coupled PDE-ODE model used to describe communication between dynamically active signaling compartments (biological cells) is analyzed using strong localized perturbation theory. In the limit D >> 1, the coupled model is reduced into a nonlinear...

Take n objects and put them in a container. What is the configuration space of all the ways they can fit in the container without intersecting? How does the topology of that configuration space change depending on the size of the objects and the size...

In 1993, Stanley showed that if a simplicial complex is acyclic over some field, then its face poset can be decomposed into disjoint rank 1 boolean intervals whose minimal faces together form a subcomplex. Stanley further conjectured that complexes...

Coding theory has been associated mainly with maintaining reliability in communication and storage systems. Yet work published already in the 1950s by Von Neumann, Moore, and Shannon also considered the use of error handling techniques to maintain...

One version of the Polycirculant Conjecture is that every finite vertex-transitive digraph admits a non-trivial semiregular automorphism. I will give an overview of the status of this conjecture, as well as describe some recent progress with Michael...

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

Motivated by problems in Bayesian nonparametrics and probabilistic programming discussed in Staton et al. (2018), we present a new kind of partial exchangeability for random arrays which we call DAG-exchangeability. In our setting, a given random...