A note on r-processes
Stephen Shea
Source: Braz. J. Probab. Stat. Volume 24, Number 3
(2010), 502-508.
Abstract
R-processes are a new type of discrete stationary stochastic process which we have recently shown to be finitarily isomorphic to Bernoulli schemes. Here, we present a simple example of an r-process and compute its entropy. Then, we prove that r-processes are weak Bernoulli.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.bjps/1280754498
Digital Object Identifier: doi:10.1214/09-BJPS106
Mathematical Reviews number (MathSciNet): MR2719699
References
Akcoglu, M. A., del Junco, A. and Rahe, M. (1979). Finitary codes between Markov processes., Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 47 305–314.
Blackwell, D. (1957). The entropy of functions of finite-state Markov chains. In, Trans. 1st Prague Conf. Information Thoery, Statistical Decision Functions, Random Processes 13–20. Prague, Czechoslovakia.
Mathematical Reviews (MathSciNet): MR100297
Zentralblatt MATH: 0085.12401
Borovkova, S., Burton, R. M. and Dehling, H. G. (2001). Limit theorems for functionals of mixing processes with applications to, U-statistics and dimension estimation. Transactions of the American Mathematical Society 353 4261–4318.
Mathematical Reviews (MathSciNet): MR1851171
Zentralblatt MATH: 0980.60031
Digital Object Identifier: doi:10.1090/S0002-9947-01-02819-7
JSTOR: links.jstor.org
Bowen, R. (1975). Smooth partitions of Anosov diffeomorphisms are weak Bernoulli., Israel Journal of Mathematics 21 95–100.
Mathematical Reviews (MathSciNet): MR385927
Zentralblatt MATH: 0315.58020
Digital Object Identifier: doi:10.1007/BF02760788
Burton, R., Goulet, M. and Meester, R. (1993). On 1-dependent processes and, k-block factors. The Annals of Probability 21 2157–2168.
Mathematical Reviews (MathSciNet): MR1245304
Zentralblatt MATH: 0788.60049
Digital Object Identifier: doi:10.1214/aop/1176989014
Project Euclid: euclid.aop/1176989014
Burton, R. M. and Steif, J. E. (1997). Coupling surfaces and weak Bernoulli in one and higher dimensions., Advances in Mathematics 132 1–23.
Mathematical Reviews (MathSciNet): MR1488237
Zentralblatt MATH: 0898.60099
Digital Object Identifier: doi:10.1006/aima.1997.1676
Ito, S., Murata, H. and Totoki, H. (1971/1972). Remarks on the isomorphism theorem for weak Bernoulli transformations in the general case., Kyoto University. Research Institute for Mathematical Sciences. Publications 7 541–580.
Mathematical Reviews (MathSciNet): MR310195
Digital Object Identifier: doi:10.2977/prims/1195193398
del Junco, A. and Rahe, M. (1979). Finitary codings and weak Bernoulli partitions., Proceedings of the American Mathematical Society 75 259–264.
Mathematical Reviews (MathSciNet): MR532147
Zentralblatt MATH: 0417.28011
Digital Object Identifier: doi:10.1090/S0002-9939-1979-0532147-2
Keane, M. and Smorodinsky, M. (1979a). Bernoulli schemes of the same entropy are finitarily isomorphic., Annals of Mathematics. Second Series 109 397–406.
Keane, M. and Smorodinsky, M. (1979b). Finitary isomorphisms of irreducible Markov shifts., Israel Journal of Mathematics 34 281–286.
Matus, F. (1998). Combining, m-dependence with Markovness. Annales de l’Institut Henri Poincaré. Probabilités et Statistiques 34 407–423.
Mathematical Reviews (MathSciNet): MR1632845
Zentralblatt MATH: 0910.60055
Digital Object Identifier: doi:10.1016/S0246-0203(98)80023-X
Marcus, B. H., Petersen, K. and Williams, S. (1984). Transmission rates and factors of Markov chains., Contempory Mathematics 26 279–292.
Mathematical Reviews (MathSciNet): MR737408
Zentralblatt MATH: 0549.28022
Parry, W. (1979). Finitary isomorphisms with finite expected code lengths., The Bulletin of the London Mathematical Society 11 170–176.
Mathematical Reviews (MathSciNet): MR541971
Zentralblatt MATH: 0425.60029
Digital Object Identifier: doi:10.1112/blms/11.2.170
Shea, S. (2009). On the marker method for constructing finitary isomorphisms., Rocky Mountain Journal of Mathematics. To appear.
Brazilian Journal of Probability and Statistics
