Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

Real and Complex Analysis

/pdf/introduction-to-the-modern-theory-of-dynamical-systems-1eced70mum.pdf

Introduction to the Modern Theory of Dynamical Systems

Part I. Examples and Fundamental Concepts Introduction 1. First examples 2. Equivalence, classification, and invariants 3. Principle classes of asymptotic invariants 4. Statistical behavior of the orbits and introduction to ergodic theory 5. Smooth invariant measures and more examples Part II. Local Analysis and Orbit Growth 6. Local hyperbolic theory and its applications 7. Transversality and genericity 8. Orbit growth arising from topology 9. Variational aspects of dynamics Part III. Low-Dimensional Phenomena 10. Introduction: What is low dimensional dynamics 11. Homeomorphisms of the circle 12. Circle diffeomorphisms 13. Twist maps 14. Flows on surfaces and related dynamical systems 15. Continuous maps of the interval 16. Smooth maps of the interval Part IV. Hyperbolic Dynamical Systems 17. Survey of examples 18. Topological properties of hyperbolic sets 19. Metric structure of hyperbolic sets 20. Equilibrium states and smooth invariant measures Part V. Sopplement and Appendix 21. Dynamical systems with nonuniformly hyperbolic behavior Anatole Katok and Leonardo Mendoza.

Introduction to the Modern Theory of Dynamical Systems: EQUILIBRIUM STATES AND SMOOTH INVARIANT MEASURES

In this paper, we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show that any computable metric space admits a universal uniform randomness test (without further assumption).

Computability of probability measures and Martin-Löf randomness over metric spaces

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show that any computable metric space admits a universal uniform randomness test (without further assumption).

Computability of probability measures and Martin-Lof randomness over metric spaces

We consider the dynamical behavior of Martin-Lof random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction, we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodic theorem) and are recurrent. We introduce and compare some notions of complexity for orbits in dynamical systems and prove: (i) that the complexity of the orbits of random points equals the Kolmogorov-Sinai entropy of the system, (ii) that the supremum of the complexity of orbits equals the topological entropy.

/pdf/effective-symbolic-dynamics-random-points-statistical-4lbfznu616.pdf

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

We extend the notion of randomness (in the version introduced by Schnorr) to computable probability spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the statistical behavior of the system (Birkhoff’s pointwise ergodic theorem). We prove that a point is Schnorr random if and only if it is typical for every mixing computable dynamics. To prove the result we develop some tools for the theory of computable probability spaces (for example, morphisms) that are expected to have other applications.

/pdf/randomness-on-computable-probability-spaces-a-dynamical-79sdjadd5a.pdf

Randomness on Computable Probability Spaces—A Dynamical Point of View

https://members.loria.fr/MHoyrup/borel_cantelli.pdf

Cristobal Rojas

Papers

Computability of probability measures and Martin-Löf randomness over metric spaces

Computability of probability measures and Martin-Lof randomness over metric spaces

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

Randomness on Computable Probability Spaces—A Dynamical Point of View

A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties