Extremal first passage times for trees

Linear and Multilinear Algebra

Volumn 48, Issue 1, 2000, Pages 21-33

  Kirkland, Stephen J ^a   Neumann, Michael ^b  

^a UNIVERSITY OF REGINA   (Canada)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

First passage times; Markov chains; Random walks; Trees

Indexed keywords

EID: 3042580976     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Ben-Israel, A. and Greville, T. N., Generalized Inverses: Theory and Applications. Academic Press, New-York, 1973.
2. Berman, A. and Plemmons, R. J., Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia, 1994.
3. Campbell, S. L. and Meyer, C. D. Jr., Generalized Inverses of Linear Transformations. Dover Publications, New York, 1991.
4. Cho, G. and Meyer, C. D. (1998). Comparison of sensitivity measures for Markov chains, Linear Algebra Appl., to appear.
5. Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains. The Annals of Appl. Prob., 1, 36-61.
6. Family, F., "Polymer statistics and universality: Principles and applications of cluster renormalization". In: Random Walks and Their Applications in the Physical and Biological Sciences, Shlesinger, M. F. and West, B. J. Eds., American Institute of Physics, pp. 33-72, New York, 1984.
7. Guattery, S., Leighton, T. and Miller, G. L., The path resistance method for bounding the smallest nontrivial eigenvalue of a Laplacian. 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997. (See also ICASE Report No. 97-51.)
8. Guattery, S. (1997). Graph embedding techniques for bounding condition numbers of incomplete factor preconditioners. Submitted to J. Numerical Linear Algebra Appl. (See also ICASE Report No. 97-47.)
9. Kemeny, J. G. and Snell, J. L., Finite Markov Chains. Van Nostrand, Princeton New-Jersey, 1959.
10. Kirkland, S. J. and Neumann, M. (1999). Cutpoint decoupling and first passage times for random walks on graphs. SIAM J. Matrix Anal., 20, 60-70.
11. Kirkland, S. J., Neumann, M. and Shader, B. (1998). Bounds on the subdominant eigenvalue involving group inverses with applications to graphs. Czech. Math. J., 48, 1-20.
12. Kirkland, S. J., Neumann, M. and Shader, B. (1997). Distances in weighted trees and group inverses of Laplacian matrices. SIAM J. Matrix. Anal. Appl., 18, 827-841.
13. Meyer, C. D. Jr. (1975). The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev., 17, 443-464.
14. Meyer, C. D. Jr. (1989). Uncoupling the Perron eigenvector problem. Linear Algebra Appl., 114/115, 69-94.
15. Moon, J. W. (1973). Random walks on random trees. J. Australian Math. Soc., 15, 42-53.
16. Rubin, R. J., "Random-walk model of chain polymer adsorption behavior at critical energy relation to a reflecting boundary condition". In: Random Walks and Their Applications in the Physical and Biological Sciences, Shlesinger, M. F. and West, B. J. Eds., American Institute of Physics, pp. 73-83, New York, 1984.