Adversarial ergodic optimization
Abstract
In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map π : (X, T) (Y, S) of topological dynamical systems, and a continuous function f ∈ C(X), what can be said about the extrema y ∈ Y ∈fx ∈ π-1 \y\ k ∞ 1k Σj = 0k - 1 f ( Tj x ) ?
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.