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

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

We prove that skew systems with a sufficiently expanding base have "approximate" statistical properties similar to random ergodic Markov chains. For example, they exhibit approximate exponential decay of correlations, meaning that the exponential...

A process Y is a factor of a process X if it can be written as Y=F(X) for some function F which commutes with translations. The factor is finitary if Y_0 is almost surely determined by some finite portion of the input X. Given a process Y, the...

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

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

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

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