pith. sign in

arxiv: cond-mat/0109243 · v1 · submitted 2001-09-13 · ❄️ cond-mat.dis-nn

Antipersistent binary time series

classification ❄️ cond-mat.dis-nn
keywords timeantipersistentseriesbinarycompletelysequencesappearscontinued
0
0 comments X
read the original abstract

Completely antipersistent binary time series are sequences in which every time that an $N$-bit string $\mu$ appears, the sequence is continued with a different bit than at the last occurrence of $\mu$. This dynamics is phrased in terms of a walk on a DeBruijn graph, and properties of transients and cycles are studied. The predictability of the generated time series for an observer who sees a longer or shorter time window is investigated also for sequences that are not completely antipersistent.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.