University of Victoria

In life history studies one often encounters situations where individuals in a population are eligible to enroll only if the response time does not exceed an associated censoring time, which leads to the so called left truncated lifetime data. While...

The Liouville quantum gravity (LQG) surface, formally defined as a 2-dimensional Riemannian manifold with conformal factor being the exponentiation of a Gaussian free field, is closely related to random planar geometry as well as scaling limits of...

A broad class of problems in extremal geometry can be characterized as follows. Fix a positive integer k and a property of k-tuples of points in R^2. The problem is then to determine how many k-tuples in an n-point set in R^2 can have the chosen...

A Latin square is an n by n grid filled with n symbols so that each symbol appears exactly once in every row and column. A transversal in a Latin square is a selection of entries with no row, column, or symbol repetition. The study of transversals in...

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

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

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