Antipersistent binary time series
Richard Metzler
Abstract
Completely antipersistent binary time series are sequences in which every time that an N-bit string μ appears, the sequence is continued with a different bit than at the last occurrence of μ. 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.
Create a lesson
Related papers
Cell-type-specific modularity in E/I networks shapes dynamical regimes and computational capabilities
Emmanouil Giannakakis, Victor Buendía, Oleg Vinogradov et al.
Finite-width shift of the edge of chaos in deep neural networks
Arn Caesar
Neural Networks with Exciton-Polariton Waveguides
Huawen Xu, Ruiqi Bao, Lingyu Tian et al.
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.