University of Victoria

I'll begin by describing shifts of finite: topological dynamical systems based on some simple combinatorial data. These have played a fundamental role in hyperbolic dynamics. I will then describe a new construction of factors (quotients) of 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...

A Glass network is a system of first order ODEs with discontinuous right hand side coming from step function terms. The "ON/OFF" switching dynamics from the step functions makes Glass networks effective at modelling switching behaviour typical of...

This talk will introduce the topic of graph product structure theory. I will show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this...

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

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

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

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

We prove that a well-known graphical expansion of the Ising model, known as the Loop O(1) model, is a factor of i.i.d. on unimodular random rooted graphs under various boundary conditions and in the presence of a non-negative external field. As an...

I will present new, non-asymptotic bounds on the heights of random combinatorial trees and conditioned Bienaymé trees, as well as stochastic inequalities relating the heights of combinatorial trees with different degree sequences. The tool for most...