A note on general sliding window processes

Noga Alon (Tel Aviv University)
Ohad Noy Feldheim (Weizmann Institute of Sciences)

Abstract


Let $f:\mathbb{R}^k\to\mathbb{R}$ be a measurable function, and let ${(U_i)}_{i\in\mathbb{N}}$ be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},...,U_{i+k-1})$. We show that for all $\ell$, there is a positive probability, uniform in $f$, for $Z_1,...,Z_\ell$ 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.

Full Text: Download PDF | View PDF online (requires PDF plugin)

Pages: 1-7

Publication Date: September 22, 2014

DOI: 10.1214/ECP.v19-3341

References

  • J. Aaronson, D. Gilat, "On the structure of stationary one dependent processes", School of Mathematical Sciences, Tel Aviv University, Israel, 1987.
  • O'Brien, G. L. Scaling transformations for $\{0,\,1\}$-valued sequences. Z. Wahrsch. Verw. Gebiete 53 (1980), no. 1, 35--49. MR0576896
  • Burton, Robert M.; Goulet, Marc; Meester, Ronald. On $1$-dependent processes and $k$-block factors. Ann. Probab. 21 (1993), no. 4, 2157--2168. MR1245304
  • Busolini, D. T. Monochromatic paths and circuits in edge-colored graphs. J. Combinatorial Theory Ser. B 10 1971 299--300. MR0274337
  • Janson, Svante. Runs in $m$-dependent sequences. Ann. Probab. 12 (1984), no. 3, 805--818. MR0744235
  • G. Moshkovitz, A. Shapira, "Integer Partitions and a New Proof of the Erdos-Szekeres Theorem", phEprint arXiv:1206.4001 [math.CO].
  • de Valk, V. The maximal and minimal $2$-correlation of a class of $1$-dependent $0$-$1$ valued processes. Israel J. Math. 62 (1988), no. 2, 181--205. MR0947821


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.