Forest formulas of discrete Green's functions
暂无分享,去创建一个
[1] Wenbo Zhao,et al. PageRank and Random Walks on Graphs , 2010 .
[2] S. Chaiken. A Combinatorial Proof of the All Minors Matrix Tree Theorem , 1982 .
[3] Hao Xu,et al. Chung-Yau Invariants and Graphs with Symmetric Hitting Times , 2017, J. Graph Theory.
[4] Elena Deza,et al. Hitting time quasi-metric and its forest representation , 2018, Optim. Lett..
[5] Shing-Tung Yau,et al. Spanning trees and random walks on weighted graphs , 2015 .
[6] Fan Chung Graham,et al. Extreme values of the stationary distribution of random walks on directed graphs , 2016, Adv. Appl. Math..
[7] ANDREW BEVERIDGE. A Hitting Time Formula for the Discrete Green's Function , 2016, Comb. Probab. Comput..
[8] Fan Chung Graham,et al. A Combinatorial Laplacian with Vertex Weights , 1996, J. Comb. Theory, Ser. A.
[9] WinklerPeter,et al. Maximum hitting time for random walks on graphs , 1990 .
[10] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[11] B. Nordstrom. FINITE MARKOV CHAINS , 2005 .
[12] Hao Xu,et al. Discrete Green's functions and random walks on graphs , 2013, J. Comb. Theory, Ser. A.
[13] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[14] Prabhakar Raghavan,et al. The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.
[15] Zhi-Li Zhang,et al. Commute Times for a Directed Graph using an Asymmetric Laplacian , 2011 .
[16] Shing-Tung Yau,et al. Discrete Green's Functions , 2000, J. Comb. Theory A.