The minimal harmonic functions of sojourn processes of certain finite state Markov chains
HTML articles powered by AMS MathViewer
- by E. Bolthausen PDF
- Proc. Amer. Math. Soc. 77 (1979), 138-144 Request permission
Abstract:
To a finite state, discrete time Markov chain a new chain is constructed which counts the number of sojourns in each state. This sojourn process is a transient Markov chain. The minimal harmonic functions of this chain are identified.References
-
D. Blackwell and D. G. Kendall, The Martin boundary of Pólya’s scheme and an application to stochastic population growth, J. Appl. Probability 1 (1964), 248-296.
G. Choquet, Lectures on analysis, Benjamin, Reading, Massachusetts, 1969.
- J. N. Darroch and E. Seneta, On quasi-stationary distributions in absorbing discrete-time finite Markov chains, J. Appl. Probability 2 (1965), 88–100. MR 179842, DOI 10.2307/3211876
- M. D. Donsker and S. R. S. Varadhan, Asymptotic evaluation of certain Markov process expectations for large time. I. II, Comm. Pure Appl. Math. 28 (1975), 1–47; ibid. 28 (1975), 279–301. MR 386024, DOI 10.1002/cpa.3160280102
- John G. Kemeny, J. Laurie Snell, and Anthony W. Knapp, Denumerable Markov chains, 2nd ed., Graduate Texts in Mathematics, No. 40, Springer-Verlag, New York-Heidelberg-Berlin, 1976. With a chapter on Markov random fields, by David Griffeath. MR 0407981
- J. Lamperti and J. L. Snell, Martin boundaries for certain Markov chains, J. Math. Soc. Japan 15 (1963), 113–128. MR 152016, DOI 10.2969/jmsj/01520113
- D. Revuz, Markov chains, 2nd ed., North-Holland Mathematical Library, vol. 11, North-Holland Publishing Co., Amsterdam, 1984. MR 758799
Additional Information
- © Copyright 1979 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 77 (1979), 138-144
- MSC: Primary 60J10; Secondary 60J50
- DOI: https://doi.org/10.1090/S0002-9939-1979-0539647-X
- MathSciNet review: 539647