Probability Seminar——Dynamical percolation on random triangular lattices
报告人：孙鑫 (Columbia University)
地点：Room 1418, Sciences Building No. 1
Abstract: Dynamical (site) percolation on a graph is a Markov process where the state space is the set of possible black/white colorings of the vertices of the graph. Each vertex is associated with an independent Poisson clock, and the color of a vertex is resampled every time its clock rings. Dynamical percolation on the regular triangular lattice was thoroughly studied by Garban, Pete and Schramm. In this talk we will discuss the case when the graph is a uniformly sampled triangulation. In particular, we will explain how to describe the scaling limit of this process and show its ergodicity. Time permitting, we will also explain the role it played in the study of the conformal structure of uniform triangulations. Based on joint work with Christophe Garban, Nina Holden and Avelio Sepulveda.