Cutpoints on trees and spherically symmetric graphs

MaRDI QIDQ4574381zbMATH OpenFDO

Authors He Song

Publication date 18 July 2018

zbMATH Keywords

treecutpointcut timenonamenablespherically symmetric graph

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Recommendations

• Cutpoints for simple random walks on quasi-transitive graphs
• No cutoff in spherically symmetric trees
• Cutpoints and resistance of random walk paths
• Cutpoints and Exchangeable Events for Random Walks
• Cutpoints of non-homogeneous random walks

Cited in

(7)

• Cutoff on trees is rare
• Most transient random walks have infinitely many cut times
• A two-spheres problem on homogeneous trees
• No cutoff in spherically symmetric trees
• Cut trees in the topological analysis of branching patterns
• Cutpoints for simple random walks on quasi-transitive graphs
• Cuts, trees and \(\ell_1\)-embeddings of graphs

This page was built for publication: Cutpoints on trees and spherically symmetric graphs

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