Hochman's upcrossing theorem for groups of polynomial growth

preprint2016arXivOpen access

Abstract

Consider a stochastic process (S[ai,bi])[ai,bi]⊂N(S_{[a_i,b_i]})_{[a_i,b_i] \subset \mathbb{N}}, which is indexed by the collection of all nonempty intervals [ai,bi]⊂N[a_i,b_i] \subset \mathbb{N} and which is stationary under translations of the intervals. It was shown by M. Hochman that, for any k≥1k \geq 1 and any interval (α,β)⊂R(α,β) \subset \mathbb{R}, one can give an `almost-exponential' bound on the size of the set where the associated process (S[1,n])n≥1(S_{[1,n]})_{n \geq 1} has at least kk fluctuations over (α,β)(α,β). It was also noticed that a similar techniques can be applied in Zd\mathbb{Z}^d case. In this article we extend Hochman's upcrossing theorem to groups of polynomial growth.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.