arXiv · 2408.14981
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 $\pi : (X, T) \to (Y, S)$ of topological dynamical systems, and a continuous function $f \in C(X)$, what can be said about the extrema $$\sup_{y \in Y} \inf_{x \in \pi^{-1} \{y\}} \lim_{k \to \infty} \frac{1}{k} \sum_{j = 0}^{k - 1} f \left( T^j x \right) ? $$
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aidan Young. 2024-08-27. Adversarial ergodic optimization. https://arxiv.org/abs/2408.14981
Cite the original work for its findings. Save a collection to share your selection of sources.