Cutpoints on trees and spherically symmetric graphs

zbMATH Open1399.05203MaRDI QIDQ4574381FDOQ4574381

Authors: He Song 

Publication date: 18 July 2018

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

zbMATH Keywords

treecutpointcut timenonamenablespherically symmetric graph

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Cited In (7)

• 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
• Cutoff on trees is rare

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)