Past Events

Shortcut graphs are graphs in which long enough cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly broad family of graphs and groups of...

Protocols and devices that exploit quantum mechanical effects can outperform their classical counterparts in certain tasks ranging from communication and computation to sensing. Intuitively speaking, the reason for this is that different physical...

We consider the linear wave equation with the time-dependent scale-invariant damping. (We also treat the corresponding equation with the energy critical nonlinearity if time permits.) Our aim is to show that the solution scatters to a modified linear...

In this talk I will discuss activated random walk (ARW) and the stochastic sandpile (SSM), two interacting particle systems that exhibit a phase transition on infinite domains and self-organized criticality on finite domains. ARW and SSM both consist...

Mean Field Game (MFG) theory studies strategic decision problems in large populations of interacting agents, which is now widely applied in economics, financial markets, engineering, social science, and many other areas. The generalization of...

Abstract: Zero mean, identically, independently distributed (i.i.d.) error is implicitly assumed in many data analysis algorithms. These assumptions are explained in example simulated data sets. Strategies to recognize violations in these assumptions...

Generative models such as Generative Adversarial Nets (GANs), Variational Autoencoders and Normalizing Flows have been very successful in the unsupervised learning task of generating samples from a high-dimensional probability distribution. However...

The PIMS-UBC Math Job Forum is an annual Forum to help graduate students and postdoctoral fellows in Mathematics and related areas with their job searches. The session is divided in two parts: short presentations from our panel followed by a...

Generative models such as Generative Adversarial Nets (GANs), Variational Autoencoders and Normalizing Flows have been very successful in the unsupervised learning task of generating samples from a high-dimensional probability distribution. However...

A directed graph H consists of a set V(H) of vertices together with a subset A(H) of V(H)×V(H) which are called arcs. A hamiltonian dipath in a digraph is a dipath that visits each vertex exactly once. The Cartesian product H 1◻H 2 of two digraphs H...