University of Victoria

The homomorphism density of a graph H in a graph G is the probability that a random function from the vertex set of H to the vertex set of G is a graph homomorphism. A natural question studied by Leontovich and Sidorenko back in the 80s and 90s is...

Structural Ramsey theory generalizes classical Ramsey theory by considering classes of finite sets with additional structure (such as finite groups or finite partial orders) and colourings of their substructures. When the class satisfies an...

Given a graph H, say that a graph G is properly rainbow H-saturated if there exists a rainbow H-free proper edge-colouring of G and, for any non-edge e of G, every proper edge-colouring of G+e contains a rainbow copy of H. The proper rainbow...

What do thunderstorms look like on the inside? Were they any different 30 to 50 thousand years ago? How might they change in the next 100 years as global temperatures continue to rise? The presentation will start with how a thunderstorm looks in 3-D...

Schrödinger operators with delta potentials are of longstanding interest for admitting solutions expressible in closed analytic forms. By some duality, these operators also receive new interest for solving moments of the continuum directed random...

This conference aims to share the most recent development in statistical data science, focusing on its applications in genomics and pharmaceutical research.Invited speakers consist of academic and industry R&D researchers. For graduate students, this...

Naively implemented, statistical procedures are prone to leaking information about their training data, which can be problematic if the data is sensitive. Differential privacy, a rigorous notion of data privacy, offers a principled framework to...

Given positive integers $p,q$ where $p$ is even and $p\geq 2q$, a circular $\frac{p}{q}$-flow in a mono-directed signed graph $(G, \sigma)$ is a pair $(D, f)$ where $D$ is an orientation on $G$ and $f: E(G)\to \mathbb{Z}$ satisfies that for each...

A spanning tree is a connected subgraph of a graph with no cycles. I will explain some well-known connection between such collection of trees and some Poissonian collection of loops, and a magical algorithm (known as Wilson's alorithm) to sample such...

Fairness in machine learning classification has been a topic of great interest given the increasing use of such classifiers in critical settings. There are many possible definitions of fairness and many potential sources of unfairness. Given this...