Extremal first passage times for trees

DOI10.1080/03081080008818657zbMath0984.60080OpenAlexW1989020885MaRDI QIDQ4762930

Michael Neumann, Stephen J. Kirkland

Publication date: 21 April 2002

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080008818657

zbMATH Keywords

random walksLaplaciantreesreturn times

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Extremal hitting times of trees with some given parameters

Cites Work

• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• Uncoupling the Perron eigenvector problem
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
• Random walks on random trees

This page was built for publication: Extremal first passage times for trees