Computer Science – Learning
Scientific paper
2006-11-13
Computer Science
Learning
8 pages, 1 figure; http://cse.ucdavis.edu/~cmg/compmech/pubs/hrct.htm
Scientific paper
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.
Crutchfield James P.
Strelioff Christopher C.
No associations
LandOfFree
How Random is a Coin Toss? Bayesian Inference and the Symbolic Dynamics of Deterministic Chaos does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How Random is a Coin Toss? Bayesian Inference and the Symbolic Dynamics of Deterministic Chaos, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How Random is a Coin Toss? Bayesian Inference and the Symbolic Dynamics of Deterministic Chaos will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-487857