SearcharxivSearch

arXiv subjects

Aidan Young

Publications and source records attributed to Aidan Young.

11 recordsLinked to original sources

An ergodic Lebesgue differentiation theorem

We show that if $(X, μ, T)$ is a probability measure-preserving dynamical system, and $\mathscr{P}$ is a countable partition of $(X, μ)$, then the limit \[ \lim_{n, k \to \infty} \mathbb{E} \left[ \frac{1}{k} \sum_{j = 0}^{k - 1} f \circ T^j \mid \bigvee_{i = 0}^{n - 1} T^{-i} \mathscr{P} \right] \] exists almost surely for all $f \in L^p(μ), p > 1$. We prove this as a corollary of a geometric result: that if $(X, μ)$ is a metric measure space on which the Hardy-Littlewood maximal inequality holds, then the limit \[\lim_{r \searrow 0, k \to \infty} \frac{1}{μ(B(x, r))} \int_{B(x, r)} \frac{1}{k} \sum_{j = 0}^{k - 1} f \circ T^j \mathrm{d} μ\] exists almost surely. In response to the first version of this article, J. Li has improved upon these results in a recent work, relaxing the assumption that $f \in L^p(μ)$ for some $p > 1$ to the assumption that $f \in L \log L(μ)$, and relaxing some of the geometric assumptions we place on the underlying probability space. We will summarize his improvements.

math.DS

Rationality and computability of the covering radius for sofic shifts

The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of a primitive sofic shift is a rational number, and describe an algorithm to compute the covering radius from a labeled graph presentation.

math.DS

Adversarial ergodic optimization

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) \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 π^{-1} \{y\}} \lim_{k \to \infty} \frac{1}{k} \sum_{j = 0}^{k - 1} f \left( T^j x \right) ? $$

math.DS

Non-alternating mean payoff games

We present and study a variant of the mean payoff games introduced by A. Ehrenfeucht and J. Mycielski. In this version, the second player makes an infinite sequence of moves only after the first player's sequence of moves has been decided and revealed. Such games occur in the computation of the covering radius of constrained systems, a quantity of interest in coding theory.

cs.IT

Noncommutative Ergodic Optimization

We extend the theory of ergodic optimization and maximizing measures to the non-commutative field of C*-dynamical systems. We then provide a result linking the ergodic optimizations of elements of a C*-dynamical system to the convergence of certain ergodic averages in a suitable seminorm. We also provide alternate proofs of several results in this article using the tools of nonstandard analysis.

math.OA

Temporo-spatial differentiations with respect to finite unions of balls

Here we study temporo-spatial differentiation problems with respect to sequences of finite unions of balls. We establish several convergence results, as well as construct pathological temporo-spatial differentiations with prescribed sets of limit points. We also demonstrate the prevalence of certain pathological temporo-spatial differentiations in the presence of a specification-like property.

math.DS

Temporo-spatial differentiations for actions of locally compact groups

In this paper, we extend the notion of temporo-spatial differentiation problems to the setting of actions of more general topological groups. The problem can be expressed as follows: Given an action $T$ of an amenable discrete group $G$ on a probability space $(X, μ)$ by automorphisms, let $(F_k)_{k = 1}^\infty$ be a Følner sequence for $G$, and let $(C_k)_{k = 1}^\infty$ be a sequence of measurable subsets of $X$ with positive probability $μ(C_k)$. What is the limiting behavior of the sequence $$\left( \frac{1}{μ(C_k)} \int_{C_k} \frac{1}{|F_k|} \sum_{g \in F_k} f(T_g x) \mathrm{d} μ(x) \right)_{k = 1}^\infty$$ for $f \in L^\infty(X, μ)$? We provide some positive convergence results for temporo-spatial differentiations with respect to ergodic averages over Følner sequences, as well as with respect to ergodic averages over subsequences of the integers (e.g. polynomials), multiple ergodic averages, and weighted ergodic averages.

math.DS

Spatial-Temporal Differentiation Theorems

Let $(X, \mathcal{B}, μ, T)$ be a dynamical system where $X$ is a compact metric space with Borel $σ$-algebra $\mathcal{B}$, and $μ$ is a probability measure that's ergodic with respect to the homeomorphism $T : X \to X$. We study the following differentiation problem: Given $f \in C(X)$ and $F_k \in \mathcal{B}$, where $μ(F_k) > 0$ and $μ(F_k) \to 0$, when can we say that $$\lim_{k \to \infty} \frac{\int_{F_k} \left( \frac{1}{k} \sum_{i = 0}^{k - 1} T^i f \right) \mathrm{d} μ}{μ(F_k)} = \int f \mathrm{d} μ? $$

math.DS

Noncommutative Ergodic Optimization and Unique Ergodicity

We extend the theory of ergodic optimization and maximizing measures to the non-commutative field of C*-dynamical systems. We then employ this ergodic optimization machinery to provide an alternate characterization of unique erogdicity of C*-dynamical systems when the resident group action satisfies certain Choquet-theoretic assumptions.

math.OA

A nonstandard-analytic proof of a theorem regarding noncommutative ergodic optimizations

In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action $G \stackrelΞ{\curvearrowright} \mathfrak{M}$ of a countable discrete amenable group $G$ on a W*-probability space $(\mathfrak{M}, ρ)$ by $ρ$-preserving $*$-automorphisms of $\mathfrak{M}$, a positive element $x \in \mathfrak{M}$, and a right Følner sequence $\mathcal{F} = (F_k)_{k \in \mathbb{N} }$ for $G$, the sequence $$\left( \left\| \frac{1}{|F_k|} \sum_{g \in F_k} Ξ_g x \right\| \right)_{ k \in \mathbb{N} }$$ converges to a value $Γ(x)$ which can be described in the language of ergodic optimization. We provide here an alternate, more direct proof of that theorem using the tools of nonstandard analysis.

math.OA