Chung-Yau Invariants and Graphs with Symmetric Hitting Times

DOI10.1002/jgt.22099zbMath1367.05198OpenAlexW2613367630MaRDI QIDQ4978297

Hao Xu, Xiao Chang

Publication date: 8 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22099

zbMATH Keywords

random walkChung-Yau invariantsreversible graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (13)

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Extremal hitting times of trees with some given parameters ⋮ Forest formulas of discrete Green's functions ⋮ Hitting times for random walks on tricyclic graphs ⋮ 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 ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ The hitting time of random walk on unicyclic graphs ⋮ Dumbbell graphs with extremal (reverse) cover cost

Cites Work

• Unnamed Item
• Random walks and the effective resistance of networks
• Resistance distance and the normalized Laplacian spectrum
• Bounds on expected hitting times for a random walk on a connected graph
• Covering problems for Brownian motion on spheres
• Feasibility conditions for the existence of walk-regular graphs
• The electrical resistance of a graph captures its commute and cover times
• Discrete Green's functions
• Discrete Green's functions and random walks on graphs
• Spanning trees and random walks on weighted graphs
• Random walks on complete multipartite graphs
• An explicit formula of hitting times for random walks on graphs
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• A tight lower bound on the cover time for random walks on graphs
• Random Walks on Regular and Irregular Graphs

This page was built for publication: Chung-Yau Invariants and Graphs with Symmetric Hitting Times