Bolthausen, Erwin A central limit theorem for the sojourn times of strongly ergodic Markov chains. (English) Zbl 0412.60027 Stochastic Processes Appl. 9, 217-222 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Review MSC: 60F05 Central limit and other weak theorems 60J65 Brownian motion Keywords:central limit theorem; weak convergence; sojourn times; strongly ergodic Markov chains PDFBibTeX XMLCite \textit{E. Bolthausen}, Stochastic Processes Appl. 9, 217--222 (1979; Zbl 0412.60027) Full Text: DOI References: [1] Baxter, J. R.; Brosamler, G. A., Energy and the law of iterated logarithm, Math. Scand., 38, 115-136 (1976) · Zbl 0346.60020 [2] E. Bolthausen, On the global asymptotic behavior of Brownian local time on the circle, Trans. Am. Math. Soc., to appear.; E. Bolthausen, On the global asymptotic behavior of Brownian local time on the circle, Trans. Am. Math. Soc., to appear. · Zbl 0413.60012 [3] Chung, K. L., (Markov Chains with Stationary Transition Probabilities (1967), Springer: Springer Berlin) · Zbl 0121.12901 [4] Gebelein, H., Das statistische Problem der Korrelation als Variations- und Eigenwertproblem und sein Zusammenhang mit der Ausgleichsrechnung, Z. Angew. Math. Mech., 21, 364-371 (1941) · JFM 67.0491.01 [5] Kemeny, J. G.; Snell, J. L.; Knapp, A. W., Denumerable Markov Chains (1976), Springer: Springer New York · Zbl 0149.13301 [6] Parthasaraty, K. R., Probability Measures on Metric Spaces (1967), Academic Press: Academic Press New York [7] Pitman, J. W., Uniform rates of convergence for Markov chain transition probabilities, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 29, 193-227 (1974) · Zbl 0373.60077 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.