Spanning trees and random walks on weighted graphs

DOI10.2140/pjm.2015.273.241zbMath1307.05207OpenAlexW2008369609MaRDI QIDQ2256311

Hao Xu, Xiao Chang, Shing Tung Yau

Publication date: 19 February 2015

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.2015.273.241

zbMATH Keywords

spanning treerandom walkhitting time

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22) Random walks on graphs (05C81)

Related Items (18)

Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk ⋮ Infinite weighted graphs with bounded resistance metric ⋮ Extremal hitting times of trees with some given parameters ⋮ Forest formulas of discrete Green's functions ⋮ Decomposition of Gaussian processes, and factorization of positive definite kernels ⋮ SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ Stochastics and dynamics of fractals ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS ⋮ Eigentime identities for on weighted polymer networks ⋮ Chung-Yau Invariants and Graphs with Symmetric Hitting Times ⋮ Realizations and factorizations of positive definite kernels ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ Dumbbell graphs with extremal (reverse) cover cost

This page was built for publication: Spanning trees and random walks on weighted graphs