922 citations · 7.2k across the 348 of their papers we have counts for
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013★ 2 cited
An explicit formula of hitting times for random walks on graphs
Hao Xu, Shing-Tung Yau
We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's boun…
math.CO2013★ 3 cited
Nodal geometry of graphs on surfaces
Yong Lin, Gabor Lippner, Dan Mangoubi +1
We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus . Using this we can show…
math.CO2013★ 5 cited
Ricci-flat graphs with girth at least five
Yong Lin, Linyuan Lu, S. -T. Yau
A graph is called Ricci-flat if its Ricci-curvatures vanish on all edges. Here we use the definition of Ricci-cruvature on graphs given in [Lin-Lu-Yau, Tohoku Math., 2011], which i…