Discrete Greenʼs functions and random walks on graphs

We prove an explicit formula of Chung–Yauʼs Discrete Greenʼs functions as well as hitting times of random walks on graphs. The formula is expressed in terms of two natural counting invariants of graphs. Uniform derivations of Greenʼs functions and hitting times for trees and other special graphs are given.