How Random Is a Coin Toss?
Bayesian Inference and the Symbolic Dynamcs of Deterministic Chaos

Chris C. Strelioff
Center for Complex Systems Research and Department of Physics
University of Illinois at Urbana-Champaign
Urbana, IL 61801
and
Center for Computational Science and Engineering
University of California at Davis
Davis, CA 95616


James P. Crutchfield
Computational Science and Engineering Center and Physics Department
University of California, Davis
One Shields Ave, Davis CA 95616

ABSTRACT: Symbolic dynamics has proven to be an invaluable tool in analyzing the mechanisms that lead to unpredictability and random behavior in nonlinear dynamical systems. Surprisingly, a discrete partition of continuous state space can produce a coarse-grained description of the behavior that accurately describes the invariant properties of an underlying chaotic attractor. In particular, measures of the rate of information production---the topological and metric entropy rates---can be estimated from the outputs of Markov or generating partitions. Here we develop Bayesian inference for k-th order Markov chains as a method to finding generating partitions and estimating entropy rates from finite samples of discretized data produced by coarse-grained dynamical systems.


C. C. Strelioff and J. P. Crutchfield, "How Random Is a Coin Toss? Bayesian Inference and the Symbolic Dynamcs of Deterministic Chaos", Conference on Neural Information Processing, Workshop on Dynamical Systems, Stochastic Processes and Bayesian Inference (2006) Online Proceedings.
[pdf] 114 kb
Santa Fe Institute Working Paper 06-11-042. arxiv.org e-print cs.LG/0611054.