We prove an explicit formula of ChungYaus Discrete Greens 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 Greens functions and hitting times for trees and other special graphs are given.

We consider a graph G and a covering G of G and we study the relations of their eigenvalues and heat kernels. We evaluate the heat kernel for an infinite k-regular tree and we examine the heat kernels for general k-regular graphs. In particular, we show that a k-regular graph on n vertices has at most (1+ o (1)) 2 log n knlog k

Let Q be an acyclic quiver and s be a sequence with elements in the vertex set Q_0. We describe an induced sequence of simple (backward) tilting in the bounded derived category D(Q), starting from the standard heart H_Q = modkQ and ending at another heart H_s in D(Q). Then we show that s is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to HQ[−1]; it is maximal if and only if H_s = H_Q[−1]. This provides a categorical way to understand green mutations. Further, fix a Coxeter element c in the Coxeter group W_Q of Q, which is admissible with respect to the orientation of Q. We prove that the sequence \tilde{w} induced by a c-sortable word w is a green mutation sequence. As a consequence, we obtain a bijection between c-sortable words and finite torsion classes in H_Q. As byproducts, the interpretations of inversions, descents and cover reflections of a c-sortable word w are given in terms of the combinatorics of green mutations.

We modify the definition of Ricci curvature of Ollivier of Markov chains on graphs to study the properties of the Ricci curvature of general graphs, Cartesian product of graphs, random graphs, and some special class of graphs.