Discrete Green's functions and random walks on graphs
From MaRDI portal
Publication:1930145
DOI10.1016/j.jcta.2012.10.002zbMath1256.05225OpenAlexW2043371501MaRDI QIDQ1930145
Publication date: 10 January 2013
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2012.10.002
Related Items (14)
Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Some further results on the maximal hitting times of trees with some given parameters ⋮ Extremal hitting times of trees with some given parameters ⋮ Forest formulas of discrete Green's functions ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ The hitting times of random walks on bicyclic graphs ⋮ Chung-Yau Invariants and Graphs with Symmetric Hitting Times ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications
This page was built for publication: Discrete Green's functions and random walks on graphs
