2000 character limit reached
On detecting and quantification of randomness for one-sided sequences (1601.06396v4)
Published 24 Jan 2016 in cs.IT, math.IT, and math.PR
Abstract: The paper studies discrete time processes and their predictability and randomness in deterministic pathwise setting, without using probabilistic assumptions on the ensemble. We suggest some approaches to quantification of randomness based on frequency analysis of two-sided and one-sided sequences. In addition, the paper suggests an extension of the notion of bandlimitiness on one-sided sequences and a procedure allowing to represent an one-sided sequence as a sum of left-bandlimited and predictable sequences and a non-reducible noise.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.