Bernoulli scheme
In
Definition
A Bernoulli scheme is a
The sample space is usually denoted as
as a shorthand for
The associated measure is called the Bernoulli measure[6]
The
is a measure space. A basis of is the cylinder sets. Given a cylinder set , its measure is
The equivalent expression, using the notation of probability theory, is
for the random variables
The Bernoulli scheme, as any stochastic process, may be viewed as a dynamical system by endowing it with the shift operator T where
Since the outcomes are independent, the shift preserves the measure, and thus T is a
is a measure-preserving dynamical system, and is called a Bernoulli scheme or a Bernoulli shift. It is often denoted by
The N = 2 Bernoulli scheme is called a
Matches and metrics
The Hamming distance provides a natural metric on a Bernoulli scheme. Another important metric is the so-called metric, defined via a supremum over string matches.[7]
Let and be two strings of symbols. A match is a sequence M of pairs of indexes into the string, i.e. pairs such that understood to be totally ordered. That is, each individual subsequence and are ordered: and likewise
The -distance between and is
where the supremum is being taken over all matches between and . This satisfies the triangle inequality only when and so is not quite a true metric; despite this, it is commonly called a "distance" in the literature.
Generalizations
Most of the properties of the Bernoulli scheme follow from the countable direct product, rather than from the finite base space. Thus, one may take the base space to be any standard probability space , and define the Bernoulli scheme as
This works because the countable direct product of a standard probability space is again a standard probability space.
As a further generalization, one may replace the integers by a
For this last case, the shift operator is replaced by the
for group elements and understood as a function (any direct product can be understood to be the set of functions , as this is the exponential object). The measure is taken as the Haar measure, which is invariant under the group action:
These generalizations are also commonly called Bernoulli schemes, as they still share most properties with the finite case.
Properties
This may be seen as resulting from the general definition of the entropy of a Cartesian product of probability spaces, which follows from the asymptotic equipartition property. For the case of a general base space (i.e. a base space which is not countable), one typically considers the
In general, this entropy will depend on the partition; however, for many dynamical systems, it is the case that the symbolic dynamics is independent of the partition (or rather, there are isomorphisms connecting the symbolic dynamics of different partitions, leaving the measure invariant), and so such systems can have a well-defined entropy independent of the partition.
Ornstein isomorphism theorem
The
The Ornstein isomorphism theorem is in fact considerably deeper: it provides a simple criterion by which many different
For the generalized case, the Ornstein isomorphism theorem still holds if the group G is a countably infinite amenable group. [11][12]
Bernoulli automorphism
An invertible,
Loosely Bernoulli
A system is termed "loosely Bernoulli" if it is Kakutani-equivalent to a Bernoulli shift; in the case of zero entropy, if it is Kakutani-equivalent to an irrational rotation of a circle.
See also
- Shift of finite type
- Markov chain
- Hidden Bernoulli model
References
- ^ P. Shields, The theory of Bernoulli shifts, Univ. Chicago Press (1973)
- ISBN 0-19-853390-X
- ^ Pierre Gaspard, Chaos, scattering and statistical mechanics (1998), Cambridge University press
- ^ .
- ^ D.S. Ornstein (2001) [1994], "Ornstein isomorphism theorem", Encyclopedia of Mathematics, EMS Press
- ISBN 978-1-84800-047-6.
- ^ Feldman, Jacob (1976). "New -automorphisms and a problem of Kakutani". .
- ^ Ya.G. Sinai, (1959) "On the Notion of Entropy of a Dynamical System", Doklady of Russian Academy of Sciences 124, pp. 768–771.
- ^ Ya. G. Sinai, (2007) "Metric Entropy of Dynamical System"
- ^ Hoffman, Christopher (1999). "A Counterexample Machine". Transactions of the American Mathematical Society. 351: 4263–4280.
- .
- arXiv:1103.4424.
- ISBN 0-387-90599-5