Hochman's upcrossing theorem for groups of polynomial growth

Abstract

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

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…