Papers
Topics
Authors
Recent
Search
2000 character limit reached

Predictive Sets

Published 12 Nov 2019 in math.DS and math.PR | (1911.04935v4)

Abstract: A set $P\subset \mathbb N$ is called predictive if for any zero entropy finite-valued stationary process $(X_i){i\in \mathbb Z}$, $X_0$ is measurable with respect to $(X_i){i\in P}$. We know that $\mathbb N$ is a predictive set. In this paper we give sufficient conditions and necessary ones for a set to be predictive. We also discuss linear predictivity, predictivity among Gaussian processes and relate these to Riesz sets which arise in harmonic analysis.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.