Simon Fraser University

Data-driven modeling refers to the use of measurement data to infer the parameters and structure of a mathematical model. Motivated by problems in collective cell biology, this talk will explore algorithms which automate the map from experimental...

Abstract. The mathematical modelling of metastasis is a challenge. The occurrence of metastasis is basically random, and the role of the immune response is not at all clear. In this talk I will discuss two models, one for the spatial spread of...

Abstract: The generalized Lotka-Volterra (gLV) equations describe the population dynamics of a set of interacting species, and are a classic model in theoretical ecology. As the number of species in these systems grow in number, their dynamics become...

Abstract:
The Constraint Satisfaction Problem (CSP) provides a general framework for a wide range of combinatorial problems. The simplest way to state the problem is: Given relational structures (say, graphs) G and H, decide if there is a...

Abstract: Given a family G of graphs on a common vertex set X, we say that G is rainbow connected if for every vertex pair u, v ∈ X, there exists a path from u to v that uses at most one edge from each graph of G. We consider the case that G contains...

Abstract: Metasurfaces are surfaces with microscopic objects on top, which can yield unexpected physical properties like, bending of light, relocating sound peaks, flat lenses, color printing, holograms and cloaking devices. In this talk we consider...

Abstract: Voronoi tessellations give rise to a wealth of analytic, geometric, and computational questions. They are also very useful in modelling. This talk will consist of three parts. In the first, I will address the simple, yet rich, question of...

The Testing Gravity 2023 (TG2023) conference is planned in person at SFU Harbour Centre, Vancouver, during January 18-21, 2023. TG2023 will be the 4th Testing Gravity conference hosted by SFU bringing together leading theorists and experts on various...

A graph drawn in a surface is a k-near-quadrangulation if the product of the lengths of its faces, except for 4-faces, is at most k. Near-quadrangulations play a fundamental role in the theory of 3-colorability of triangle-free graphs on surfaces. We...