Spanning trees and random walks on weighted graphs

DOI10.2140/PJM.2015.273.241MaRDI QIDQ2256311zbMATH OpenOpenAlexFDO

Authors Xiao Chang, Hao Xu, 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

hitting timerandom walkspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Discrete Green's functions and random walks on graphs
• An explicit formula of hitting times for random walks on graphs
• Non-uniform random spanning trees on weighted graphs
• Random walks on complete multipartite graphs
• Chung-Yau invariants and graphs with symmetric hitting times

Cited in

(26)

• Further results on the expected hitting time, the cover cost and the related invariants of graphs
• Discrete Green's functions and random walks on graphs
• From elongated spanning trees to vicious random walks
• Dumbbell graphs with extremal (reverse) cover cost
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
• On the (reverse) cover cost of trees with some given parameters
• Realizations and factorizations of positive definite kernels
• Expected hitting times for random walks on the \(k\)-triangle graph and their applications
• An explicit formula of hitting times for random walks on graphs
• Spanning trees in random series-parallel graphs
• Hitting times, cover cost, and the Wiener index of a tree
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• Infinite weighted graphs with bounded resistance metric
• 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
• Chung-Yau invariants and graphs with symmetric hitting times
• Extremal hitting times of trees with some given parameters
• Decomposition of Gaussian processes, and factorization of positive definite kernels
• Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
• Eigentime identities for on weighted polymer networks
• A hitting time formula for the discrete Green's function
• Forest formulas of discrete Green's functions
• SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
• Stochastics and dynamics of fractals
• Spectral analysis and its applications for a class of scale-free network based on the weighted m-clique annex operation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256311)