Jun 02, 2025
Monday
|
08:30 AM - 09:15 AM
|
|
Registration
|
- Location
- --
- Video
-
--
- Abstract
- --
- Supplements
-
--
|
09:15 AM - 09:30 AM
|
|
Opening Ceremony
|
- Location
- --
- Video
-
--
- Abstract
- --
- Supplements
-
--
|
09:30 AM - 11:00 AM
|
|
Heat kernel estimates, Harnack inequalities, and quassisymmetry
Mathav Murugan (University of British Columbia)
|
- Location
- --
- Video
-
--
- Abstract
The heat kernel is the fundamental solution to a parabolic partial differential equation. From a probabilistic perspective, the heat kernel is the transition probability density of a stochastic process. Harnack inequalities and functional inequalities such as Poincare and Sobolev inequalities provide tools to understand the relationship between the behavior of the heat kernel and the geometry of the underlying space. An important feature of the approach using functional inequalities is its robustness under perturbations.
The study of the heat kernel and its estimates has produced fruitful interactions between the fields of Analysis, Geometry, and Probability. One of the goals of this course is to illustrate these interactions of heat kernel estimates with functional inequalities, boundary trace processes, quasisymmetric maps, circle packings, the time change of Markov processes, Doob's h-transform, and estimates of harmonic measure or exit distribution.
The setting for this course is a symmetric Markov process which is equivalently described using a Dirichlet form. This course will contain an introduction to the theory of Dirichlet forms. This theory will be used to construct and analyze Markov processes. This course will survey both classical results and recent progress in our understanding of heat kernel estimates and Harnack inequalities.
- Supplements
-
--
|
11:30 AM - 01:00 PM
|
|
Topics in Percolation
Tom Hutchcroft (California Institute of Technology)
|
- Location
- --
- Video
-
--
- Abstract
In Bernoulli bond percolation, we delete or retain each edge of a graph independently at random with some retention parameter pand study the geometry of the connected components (clusters) of the resulting subgraph. For lattices of dimension d>1, percolation has a phase transition, with a infinite cluster emerging at a critical probability pc(d). It is believed that critical percolation at and near the critical probability exhibits rich, fractal-like geometry that is expected to be approximately independent of the choice of lattice but highly dependent on the dimension d. In particular, various qualitative distinctions are expected between the low dimensional case d<6, the high-dimensional case d>6, and the critical case d=6, but this remains poorly understood particularly in dimensions d=3,4,5,6.
In this course, I will give an overview of of what is known about critical percolation, focussing on the non-planar models and including a detailed treatment of recent advances in long-range and hierarchical models for which various aspects of intermediate-dimensional critical phenomena can now be understood rigorously.
No prior knowledge of percolation will be assumed.
- Supplements
-
--
|
02:30 PM - 02:55 PM
|
|
Short Talk: Ryoichiro Noda
|
- Location
- --
- Video
-
--
- Abstract
Consider two independent and identically distributed continuous-time Markov chains $X$ and $Y$ on a graph with vertex set $V$. The collision measure $\Pi$, which describes the times and positions of collisions of $X$ and $Y$, is given as a random measure on $\mathbb{R}_{\geq 0} \times V$ by $\Pi([0,t] \times E) = \int_{0}^{t} 1_{\{X(s) = Y(s)\}} ds.$. We have shown that if graphs converge to a metric space in an appropriate Gromov-Hausdorff-type topology with respect to the effective resistance metric, and if there is a suitable upper bound on the heat kernels of the Markov chains on the graphs, then the two independent Markov chains on the graph and its collision measure converge to stochastic processes on the limiting space and its collision measure. The collision measure of the limiting stochastic processes is constructed using positive continuous additive functionals (PCAFs) in Dirichlet form theory. This applies to many low-dimensional spaces, such as the Sierpi\'{n}ski gasket and the Brownian random tree.
- Supplements
-
--
|
03:00 PM - 03:25 PM
|
|
Short Talk: Aram Perez
|
- Location
- --
- Video
-
--
- Abstract
Stein’s Method is a powerful tool for studying distances between distributions of random variables. It has been used widely in the context of statistical mechanics to obtain approximations for various thermodynamic quantities. We will discuss an application of Stein’s Method to the $O(N)$ model, a model of magnetism, and show how recent advances in Stein’s theory allow us to study the limiting behaviour of the magnetisation at the phase transition.
- Supplements
-
--
|
03:30 PM - 03:55 PM
|
|
Short Talk: Brian Chao
|
- Location
- --
- Video
-
--
- Abstract
The principal Dirichlet Laplacian eigenfunction $\varphi_U$ describes the invariant measure of a Brownian motion conditioned to remain inside a bounded domain $U\subseteq \mathbb{R}^n$. In this talk, I will present results about how domain perturbations affect $\varphi_U$. These results lead to explicit expressions for $\varphi_U$ in certain Euclidean domains, thus implying improved Dirichlet heat kernel estimates. This is joint work with Laurent Saloff-Coste.
- Supplements
-
--
|
|
Jun 03, 2025
Tuesday
|
09:30 AM - 11:00 AM
|
|
Topics in Percolation
Tom Hutchcroft (California Institute of Technology)
|
- Location
- --
- Video
-
--
- Abstract
In Bernoulli bond percolation, we delete or retain each edge of a graph independently at random with some retention parameter pand study the geometry of the connected components (clusters) of the resulting subgraph. For lattices of dimension d>1, percolation has a phase transition, with a infinite cluster emerging at a critical probability pc(d). It is believed that critical percolation at and near the critical probability exhibits rich, fractal-like geometry that is expected to be approximately independent of the choice of lattice but highly dependent on the dimension d. In particular, various qualitative distinctions are expected between the low dimensional case d<6, the high-dimensional case d>6, and the critical case d=6, but this remains poorly understood particularly in dimensions d=3,4,5,6.
In this course, I will give an overview of of what is known about critical percolation, focussing on the non-planar models and including a detailed treatment of recent advances in long-range and hierarchical models for which various aspects of intermediate-dimensional critical phenomena can now be understood rigorously.
No prior knowledge of percolation will be assumed.
- Supplements
-
--
|
11:30 AM - 01:00 PM
|
|
Heat kernel estimates, Harnack inequalities, and quasisymmetry
Mathav Murugan (University of British Columbia)
|
- Location
- --
- Video
-
--
- Abstract
The heat kernel is the fundamental solution to a parabolic partial differential equation. From a probabilistic perspective, the heat kernel is the transition probability density of a stochastic process. Harnack inequalities and functional inequalities such as Poincare and Sobolev inequalities provide tools to understand the relationship between the behavior of the heat kernel and the geometry of the underlying space. An important feature of the approach using functional inequalities is its robustness under perturbations.
The study of the heat kernel and its estimates has produced fruitful interactions between the fields of Analysis, Geometry, and Probability. One of the goals of this course is to illustrate these interactions of heat kernel estimates with functional inequalities, boundary trace processes, quasisymmetric maps, circle packings, the time change of Markov processes, Doob's h-transform, and estimates of harmonic measure or exit distribution.
The setting for this course is a symmetric Markov process which is equivalently described using a Dirichlet form. This course will contain an introduction to the theory of Dirichlet forms. This theory will be used to construct and analyze Markov processes. This course will survey both classical results and recent progress in our understanding of heat kernel estimates and Harnack inequalities.
- Supplements
-
--
|
02:30 PM - 02:55 PM
|
|
Short Talk: Jose Chacon Martinez
|
- Location
- --
- Video
-
--
- Abstract
Exchangeable fast fragmentation-coalescence (EFFC) processes are partition-valued processes on P(N) that combine a coalescence mechanism with an extreme form of fragmentation that drives the number of blocks to infinity. In our current research, we investigate the property of coming down from infinity (CDFI), which refers to the ability of the associated block counting process to become finite instantaneously, even when starting from an infinite number of blocks. We approach this through extensions of classic techniques from coalescence theory, such as the look-down construction and duality with forward-in-time frequency processes, among others. In particular, for 0 < alpha < 1, we establish a novel threshold for CDFI in the EFFC process arising from the combination of a Beta(alpha, 2 - alpha)-coalescent with a class of extreme fragmentation mechanisms.
- Supplements
-
--
|
03:00 PM - 03:25 PM
|
|
Short Talk: Caelan Atamanchuk
|
- Location
- --
- Video
-
--
- Abstract
A \emph{temporal graph} is a pair $(G,\lambda)$, where $G$ is a simple graph and $\lambda$ is some ordering of the edges of $G$. We say that a path $P$ from $u$ to $v$ in $G$ is \emph{increasing} if $\lambda$ increases when travelling from $u$ to $v$ on $P$, and we say that $u$ \emph{can reach} $v$ if there is an increasing path from $u$ to $v$ in $G$. In recent years, a lot of study has been put towards understanding how reachability in temporal graphs compares to reachability ordinary static graphs. The case where $G$ is an Erd\"os-R\'{e}nyi random graph and $\lambda$ is a uniform permutation (called a \emph{random simple temporal graph}) has been one model of large interest, and many nice phase transitions for varying levels of temporal connectedness have been identified. Using the study of random simple temporal graphs as motivation, I will introduce the notion of random temporal trees and present some of their interesting properties. The results will come from joint work with Luc Devroye and Gabor Lugosi.
- Supplements
-
--
|
|