Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-28T00:18:21.056Z Has data issue: false hasContentIssue false
  • English
  • Français

Threshold Functions for Markov Chains: a Graph Theoretic Approach

Published online by Cambridge University Press:  12 September 2008

James F. Lynch
James F. Lynch
Affiliation:
Department of Mathematics and Computer Science, Clarkson University, Potsdam, N. Y. 13699-5815
Get access Rights & Permissions [Opens in a new window]

Abstract

A new graph theoretic proof of the convergence of Markov chains with variable transition probabilities and a new algorithm for computing the limiting distributions are presented.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 3 , September 1993 , pp. 351 - 362
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Feller, W. (1967) An Introduction to Probability Theory and its Application, 3rd ed., Wiley, New York.Google Scholar
[2]Hassin, R. and Haviv, M. (1992) Mean passage times and nearly uncoupled Markov chains. SIAM J. Disc. Math. 5 386–397.CrossRefGoogle Scholar
[3]Kato, T. (1966) Perturbation Theory for Linear Operators, Springer-Verlag, Berlin.Google Scholar
[4]Kemeny, J. G. and Snell, J. L. (1976) Finite Markov Chains, Springer-Verlag, New York-Heidelberg.Google Scholar
[5]Lynch, J. F. (1980) Almost sure theories. Ann. Math. Logic 18 91–135.CrossRefGoogle Scholar
[6]Lynch, J. F. (1993) Convergence laws for random words. Australian J. Comb. 7 145–156.Google Scholar
[7]Markushevich, A. I. (1977) Theory of Functions of a Complex Variable, 2nd ed., Chelsea, New York.Google Scholar
[8]Palmer, E. M. (1985) Graphical Evolution, Wiley, New York.Google Scholar
[9]Rohlicek, J. R. and Willsky, A. S. (1988) The reduction of perturbed Markov generators: An algorithm exposing the role of transient states. J. ACM 35 675–696.CrossRefGoogle Scholar
[10]Shelah, S. and Spencer, J. (submitted) Random sparse unary predicates. Random Struct. Alg.Google Scholar
[11]Simon, H. A. and Ando, A. (1961) Aggregation of variables in dynamic systems. Econometrica 29 111–138.CrossRefGoogle Scholar