PIMS - SFU Discrete Math Seminar: Fan Chung (Round the World Relay in Combinatorics)

Abstract: The Green's functions of a graph are the pseudo inverses of the Laplacians and therefore are useful for solving many types of Laplace equations in discrete settings.In this talk, we will give combinatorial interpretations of Green's functions in terms of counting trees and forests in a graph. We will also mention several applications concerning the pagerank algorithms and the hitting time for random walks. *This is a special session for the Round the World Relay in Combinatorics