Past Events

In the classical pointwise ergodic theorem for a probability measure preserving (pmp) transformation \(T\), one takes averages of a given integrable function over the intervals \(\{x, T(x), T^2(x), \ldots, T^n(x)\}\) in the forward orbit of the point...

The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $t$-power of the $r$...

Recently we proved a theorem for strongly regular graphs that provides numerical restrictions on the number of fixed vertices and the number of vertices mapped to adjacent vertices under an automorphism. We then used this result to develop some new...

Given a collection of points S in a metric space and a probability p in (0,1), one can make a random graph by independently joining any pair of points in S that are less than 1 apart by an edge with probability p; and no edge with probability 1-p...

What have I learned about building mathematical communities over the last twenty years, initially in North America and more recently in Africa and South America? What does “belonging” mean to those who are already part of a mathematical community...

Cops and Robber is a well-studied pursuit-evasion game played on graphs. In this talk, I’ll discuss a variation of the game with a new capture condition. Instead of a win for the cop side resulting from at least one of the cops occupying the same...

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

A discrete quantum walk usually takes place on the arcs of a graph. Each step of the walk consists of two operations - a "coin flip" and an "arc shift". In this talk, we will consider quantum walks where the "arc shift" simply reverses each arc...