202

BIBLIOGRAPHY

[18] Y. N. Dowker. On measurable transformations in finite measure spaces. Ann. of Math., 62:504
516, November 1955.
[19] R. M. Dudley. Distances of probability measures and random variables. Ann. of Math. Statist.,
39:15631572, 1968.
[20] N. A. Friedman. Introduction to Ergodic Theory. Van Nostrand Reinhold Company, New York,
1970.
[21] A. Garsia. A simple proof of E. Hophs maximal ergodic theorem. J. Math. Mech., 14:381382,
1965.
[22] R. M. Gray. Oversampled sigma-delta modulation. IEEE Trans. Comm., COM-35:481489,
April 1987.
[23] R. M. Gray and L. D. Davisson. Source coding without the ergodic assumption. IEEE Trans.
Inform. Theory, IT-20:502516, 1974.
[24] R. M. Gray and L. D. Davisson. Random Processes: A Mathematical Approach for Engineers.
Prentice-Hall, Englewood Cliffs,New Jersey, 1986.
[25] R. M. Gray, R. M. Gray, and L. D. Davisson, editors. Ergodic and Information Theory,
volume 19 of Benchmark Papers in Electrical Engineering and Computer Science. Dowden,Hutchinson,& Ross, Stroudsbug PA, 1977.
[26] R. M. Gray and J. C. Kieffer. Asymptotically mean stationary measures. Ann. Probab., 8:962
973, 1980.
[27] R. M. Gray, D. L. Neuhoff, and P. C. Shields. A generalization of ornsteins d-bar distance with
applications to information theory. Ann. Probab., 3:315328, April 1975.
[28] P. R. Halmos. Invariant measures. Ann. of Math., 48:735754, 1947.
[29] P. R. Halmos. Measure Theory. Van Nostrand Reinhold, New York, 1950.
[30] P. R. Halmos. Lectures on Ergodic Theory. Chelsea, New York, 1956.
[31] P. R. Halmos. Introduction to Hilbert Space. Chelsea, New York, 1957.
[32] J. M. Hammersley and D. J. A. Welsh. First-passage,percolation,subadditive processes, stochastic networks,and generalized renewal theory. Bernoulli-Bayes-Laplace Anniversary Volume,
1965.
[33] F. R. Hample. A general qualitative definition of robustness. Ann. of Math. Statist., 42:1887
1896, 1971.
[34] E. Hoph. Ergodentheorie. Springer-Verlag, Berlin, 1937.
[35] H. Inose and Y. Yasuda. A unity bit coding method by negative feedback. Proc. IEEE, 51:1524
1535, November 1963.
[36] K. Jacobs. The ergodic decomposition of the Kolmogorov-Sinai invariant. In F. B. Wright and
F. B. Wright, editors, Ergodic Theory. Academic Press, New York, 1963.

BIBLIOGRAPHY

203

[37] R. Jones. New proof for the maximal ergodic theorem and the hardy-littlewood maximal
inequality. Proc. Amer. Math. Soc., 87:681684, 1983.
[38] I. Katznelson and B. Weiss. A simple proof of some ergodic theorems. Israel Journal of
Mathematics, 42:291296, 1982.
[39] J. F. C. Kingman. The ergodic theory of subadditive stochastic processes. Ann. Probab.,
1:883909, 1973.
[40] A. N. Kolmogorov. Foundations of the Theory of Probability. Chelsea, New York, 1950.
[41] U. Krengel. Ergodic Theorems. De Gruyter Series in Mathematics. De Gruyter, New York,
1985.
[42] N. Kryloff and N. Bogoliouboff. La theorie generale de la mesure dans son application `a letude
des syst`emes de la mecanique non lineaire. Ann. of Math., 38:65113, 1937.
[43] V. I. Levenshtein. Binary codes capable of correcting deletions, insertions,and reversals. Sov.
Phys.-Dokl., 10:707710, 1966.
[44] M. Loeve. Probability Theory. D. Van Nostrand, Princeton,New Jersey, 1963. Third Edition.
[45] D. G. Luenberger. Optimization by Vector Space Methods. Wiley, New York, 1969.
[46] G. Mackey. Borel structures in groups and their duals. Trans. Amer. Math. Soc., 85:134165,
1957.
[47] L. E. Maistrov. Probability Theory: A Historical Sketch. Academic Press, New York, 1974.
Translated by S. Kotz.
[48] J. Moser, E. Phillips, and S. Varadhan. Ergodic Theory: A Seminar. Courant Institute of Math.
Sciences, New York, 1975.
[49] J. Nedoma. On the ergodicity and r-ergodicity of stationary probability measures. Z. Wahrsch.
Verw. Gebiete, 2:9097, 1963.
[50] D. Ornstein. An application of ergodic theory to probability theory. Ann. Probab., 1:4358,
1973.
[51] D. Ornstein. Ergodic Theory,Randomness,and Dynamical Systems. Yale University Press, New
Haven, 1975.
[52] D. Ornstein and B. Weiss. The Shannon-McMillan-Breiman theorem for a class of amenable
groups. Israel J. of Math, 44:5360, 1983.
[53] J. C. Oxtoby. Ergodic sets. Bull. Amer. Math. Soc., Volume 58:116136, 1952.
[54] P. Papantoni-Kazakos and R. M. Gray. Robustness of estimators on stationary observations.
Ann. Probab., 7:9891002, Dec. 1979.
[55] K. R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, New York, 1967.
[56] I. Paz. Stochastic Automata Theory. Academic Press, New York, 1971.
[57] K. Petersen. Ergodic Theory. Cambridge University Press, Cambridge, 1983.

204

BIBLIOGRAPHY

[58] H. Poincare. Les methodes nouvelles de la mecanique celeste, volume I,II,III. Gauthiers-Villars,
Paris, 1892,1893,1899. Also Dover,New York,1957.
[59] O. W. Rechard. Invariant measures for many-one transformations. Duke J. Math., 23:477488,
1956.
[60] V. A. Rohlin. Selected topics from the metric theory of dynamical systems. Uspechi Mat. Nauk.,
4:57120, 1949. AMS Transactions (2) 49.
[61] W. Rudin. Principles of Mathematical Analysis. McGraw-Hill, New York, 1964.
[62] L. Schwartz. Radon Measures on Arbitrary Topological Spaces and Cylindrical Measures. Oxford
University Press, Oxford, 1973.
[63] P. C. Shields. The Theory of Bernoulli Shifts. The University of Chicago Press, Chicago,Ill.,
1973.
[64] P. C. Shields. The ergodic and entropy theorems revisited. IEEE Trans. Inform. Theory,
IT-33:263266, 1987.
[65] G. F. Simmons. Introduction to Topology and Modern Analysis. McGraw-Hill, New York, 1963.
[66] Ya. G. Sinai. Introduction to Ergodic Theory. Mathematical Notes,Princeton University Press,
Princeton, 1976.
[67] V. Strassen. The existence of probability measures with given marginals. Ann. of Math. Statist.,
36:423429, 1965.
[68] E. Tanaka and T. Kasai. Synchronization and subsititution error correcting codes for the
levenshtein metric. IEEE Trans. Inform. Theory, IT-22:156162, 1976.
[69] S. S. Vallender. Computing the wasserstein distance between probability distributions on the
line. Theory Probab. Appl., 18:824827, 1973.
[70] L. N. Vasershtein. Markov processes on countable product space describing large systems of
automata. Problemy Peredachi Informatsii, 5:6473, 1969.
[71] J. von Neumann. Zur operatorenmethode in der klassischen mechanik. Ann. of Math., 33:587
642, 1932.
[72] P. Walters. Ergodic Theory-Introductory Lectures. Lecture Notes in Mathematics No. 458.
Springer-Verlag, New York, 1975.
[73] F. B. Wright. The recurrence theorem. Amer. Math. Monthly, 68:247248, 1961.

Index
barycenter, 187, 192
base, 50
basis, 28, 29
binary indexed, 27
Birkhoff ergodic theorem, 153
Birkhoff, George, 153
block AMS, 158
block stationary, 131
Borel field, 43, 50
Borel sets, 50
Borel space, 25, 49
Borel-Cantelli lemma, 86

F set, 51
G , 51
G set, 51
Lp norm, 85
N -ergodic, 150
Z, 10
-distance, 180
-field, 5
Z+ , 10
absolutely continuous, 105, 107
addition, 10, 36
additive, 7
finitely, 7
affine, 192, 195
almost everywhere, 74, 83, 84
almost everywhere ergodic theorem, 153
almost surely, 84
alphabet, 5, 8, 65, 66
AMS, 131
block, 158
analytic space, 25
arithmetic mean, 82
asymoptotically dominates, 134
asymptotic mean expectation, 142
asymptotic mean stationary, 123
asymptotically generate, 29
asymptotically generates, 27
asymptotically mean stationary, 93, 131
atom, 26
autocorrelation, 82
average, 65

Cearo mean, 82
canonical binary sequence function, 28
Cantors intersection theorem, 53
Caratheodory, 17, 22, 26, 41, 42, 177
cartesian product, 37
cartesian product space, 13
carving, 57
Cauchy sequence, 53
Cauchy-Schwarz inequality, 76
chain rule, 80
change of variables, 80
circular distance, 35
class
separating, 30
code, 23
complete metric space, 53
compressed, 139
conditional expectation, 102
conservative, 140
consistent, 41
continuity at , 7
continuity from above, 7
continuity from below, 7
continuous, 178
continuous function, 52
converge

bad atoms, 32
ball
open, 49
Banach
space, 53
Banach space, 53
205

INDEX

206
in mean square, 85
in quadratic mean, 85
converge weakly, 179
convergence, 38, 84
L1 (m), 85
L2 (m), 85
with probability one, 84
coordinate function, 82
countable extension property, 26, 40
countable subadditivity, 18
countably generated, 26
cover, 18
covergence
in probability, 84
cylinders
thin, 34
de Morgans laws, 6
dense, 52
diagonal sequence, 38
diagonalization, 38
diameter, 50
digital measurement, 66
directly given random process, 15
discrete time random process, 10
distance, 35
, 180
circular, 35
distributional, 175
Hamming, 35
Levenshtein, 36
rho-bar, 180
shtein, 180
stein, 180
distribution, 8, 14
distributional distance, 175
dominated convergence theorem, 78
dynamical system, 11
recurrent, 138
ensemble average, 66
equivalent, 107
equivalent metrics, 50
equivalent random processes, 15
ergodic, 147
totally, 159
ergodic component, 190
ergodic decomposition, 160, 161, 187, 198

ergodic properties, 123, 146

ergodic property, 124
ergodic theorem, 65
subadditive, 164
ergodic theory, 11
ergodicity, 146
Euclidean norm, 37
Euclidean space, 36, 54
event
recurrent, 138
event space, 5
events
input, 8
expectation, 66
conditional, 102
extended Fatous lemma, 78
extended monotone convergence theorem, 77
extension of probability measures, 25
extension theorem, 41
Fatous lemma, 78
field, 6
standard, 29, 40
fields
increasing, 27
finite additivity, 7
finite intersection property, 29
finitely additive, 7
function
continuous, 52
tail, 136
generated -field, 13
generic points, 160
good sets priciple, 32
good sets principle, 14, 26
Hamming distance, 35
Hilbert space, 53, 102
i.o., 133
IID, 149
incompressible, 140
increasing fields, 27
independent, 117
independent and identically distributed, 149
indicator function, 9, 28
infinitely recurrent, 140
inner product, 85