Past Events

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...

Decision-makers attempting to restrict the spread of forest pests through infested firewood imported as a result of decisions of the population of park users must contend with population behaviour that both causes pest outbreaks, and responds to them...

It has been just over one year and 100 million cases since we first heard of a novel coronavirus with pandemic potential. We are now all far too familiar with epidemic curves and would very much like to see the tail of this one. In this talk, I will...

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...