A note on general sliding window processes
Abstract
Let f:Rk R be a measurable function, and let \Ui\i∈N be a sequence of i.i.d. random variables. Consider the random process Zi=f(Ui,...,Ui+k-1). We show that for all , there is a positive probability, uniform in f, for Z1,...,Z to be monotone. We give upper and lower bounds for this probability, and draw corollaries for k-block factor processes with a finite range. The proof is based on an application of combinatorial results from Ramsey theory to the realm of continuous probability.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.