北京雁栖湖应用数学研究院

From the view point of potential theory, infinite graphs form a discrete model of noncompact Riemannian manifolds. For a discrete Laplacian on a network, the corresponding discrete Poisson equation is related to Kirchhoff's electric circuit laws. On the other hand, there is an interplay between infinite networks and the theory of Markov chains. In this course, we introduce basic results on infinite networks, such as extremal length. We will discuss its connections to circle packings.