Semi-Random Ergodic Averages

• Semi-random ergodic averages are averages that evaluate functions along sequences combining deterministic growth with random fluctuations, offering insights into convergence and mixing properties.
• They are analyzed using advanced tools such as van der Corput's method, Calderón–Zygmund decomposition, and Bourgain’s variation technology to control convergence rates and oscillations.
• Applications include modeling physical systems like random billiards and mixing flows, which illuminate sparse and structured dynamics in both theoretical and practical contexts.

A semi-random ergodic average refers to an ergodic average formed by evaluating a function along a sequence that interpolates between deterministic and random characteristics—sometimes arising as deterministic images of random or dynamically defined times, hitting/return times in mixing systems, or mixtures of deterministic and random mechanisms. These averages are studied to understand fine mixing, convergence, and ergodic properties across the full spectrum between classical deterministic and fully random dynamical systems. Theoretical advances in the analysis of such averages clarify ergodic behavior in sparse, structured, or physically motivated systems and illuminate new regularity and quantitative phenomena not accessible via either extreme alone.

1. Definition and Canonical Examples

For a measure-preserving dynamical system $(X, \mathcal{X}, \mu, T)$, a classical ergodic average is

$A_Nf(x) = \frac{1}{N} \sum_{n=1}^N f(T^n x).$

A semi-random ergodic average evaluates $f$ along a nonstandard, typically sparse sequence $\{a_n\}$:

$A_N f(x) = \frac{1}{N} \sum_{n=1}^N f(T^{a_n} x).$

Here, $\{a_n\}$ may be generated by:

• Random mechanisms such as $a_n = \min\{k: \sum_{j=1}^k X_j = n\}$ where $X_j$ are independent Bernoulli random variables with expectation $j^{-\alpha}$, $0<\alpha<1/2$ (Krause et al., 16 Apr 2025, LaVictoire et al., 2012, Frantzikinakis et al., 2010).
• Return/hitting times in mixing systems (e.g., $a_n$ being the $n$th time $S^{a_n}y$ hits a shrinking target set, with $S$ mixing and $\nu(I_n)=n^{-a}$) (Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).
• Structured semi-random models from dynamics, as in alternating random walks or rough-disk stochastic billiards (Markov processes with singular transition kernels) (Rudzis, 2023).

A canonical deterministic sequence is $a_n = \lfloor n^c \rfloor$, $1 < c < 8/7$. Random or dynamically generated sequences may interpolate between this and IID randomizations, often producing similar asymptotic behavior but via distinct mechanisms.

2. Ergodic and Pointwise Convergence Theorems

The central question for semi-random averages is almost-everywhere convergence: Does $A_N f(x) \to \int f\,d\mu$ $\mu$-almost everywhere for $f \in L^1(X)$?

Key theorems include:

• Sparse sequences $a_n = \lfloor n^c \rfloor$, $1 < c < 8/7$, and random hitting times (as above) yield a.e. convergence for all $f\in L^1(X)$ (Krause et al., 16 Apr 2025).
• In the group setting, for $\mathbb{Z}^d$ (and virtually nilpotent groups), random sparse sets defined by Bernoulli selectors with probabilities $|n|^{-\gamma}$ ($0<\gamma<d/2$) give almost-sure $L^1$-pointwise ergodic theorems (LaVictoire et al., 2012).
• Sequences of return times to shrinking targets in rapidly mixing systems, such as $$\left\{ n\in \mathbb{N}: 2^n y \bmod{1} \in (0, n^{-a}) \right\}$$, are pointwise universally $L^2$-good, i.e., averages converge to $\mathbb{E}_\mu [f\,|\,\mathcal{I}(T)]$ for all $f\in L^2(\mu)$ and, in product-type settings, for multiple commuting transformations (Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).
• Alternating random walks and rough-disk stochastic billiards: ergodicity is characterized via criteria on associated Markov transition kernels, often involving reversibility and irreducibility for suitable invariant measures (e.g., uniform or Lambertian measure) (Rudzis, 2023).

3. Quantitative Rates and Regularity

Recent advances include new quantitative estimates for the rate and regularity of convergence:

• Bourgain's variation, jump-counting, and oscillation norms provide explicit control on the speed and fluctuations of $A_N f(x)$ for both deterministic and random semi-random sequences (Krause et al., 16 Apr 2025). These methods quantify convergence beyond mere almost-everywhere existence.
• For hitting-time-generated sequences, moment and covariance estimates (laws of large numbers, fourth-moment bounds derived from mixing properties) yield precise control necessary for strong limit theorems (Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).
• Spectral-gap and minorization estimates for Markov chains corresponding to semi-random walks or billiards yield $L^2$-rates in those contexts, although such estimates are not always developed fully (Rudzis, 2023).

4. Structural Comparison: Deterministic, Random, and Semi-Random Paradigms

The behavior of ergodic averages depends crucially on the structure of the underlying sequence $\{a_n\}$:

Paradigm	Sequence Law	Typical Limiting Behavior	Methods
Deterministic	$a_n = \lfloor n^c \rfloor$	Convergence for $c$ near 1	Exponential sum bounds, van der Corput, transfer
Random	Bernoulli indices, $n^{-a}$	A.e. and $L^p$ convergence	Concentration, independence, maximal inequalities
Semi-Random	Return/hitting times, Markovian	Interpolates between deterministic and random: a.e./$L^p$ convergence, regularity	Decay of correlation, covariance/mixing, adapted maximal inequalities

Purely deterministic gaps ($a_n$ growing rapidly, $c$ large) present substantial obstacles for almost-everywhere convergence, presently surmountable only for $c<8/7$ (Krause et al., 16 Apr 2025). Fully random versions break correlations, allowing use of probabilistic maximal and decoupling methods (Frantzikinakis et al., 2010). Semi-random constructions—especially based on mixing dynamical systems—retain enough spreading and weak dependence to inherit much of the stochastic theory's strength without full independence (Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).

5. Applications and Physical Motivations

Physical and mathematical models motivating semi-random averages include:

• Random billiards and rough microstructures: Alternating random walks and rough-disk stochastic billiards model scattering phenomena with singular transition kernels, producing ergodic (and in some cases mixing) behavior intermediate between diffusive and deterministic billiards. Explicit criteria and examples (rectangular teeth, focusing arcs, $\delta$-nub modfications) illustrate how microstructure determines macro-scale ergodicity (Rudzis, 2023).
• Mixing flows and dynamical systems: Hitting times for shrinking targets in strongly mixing transformations (e.g., doubling maps, expanding maps) produce semi-random sequences instrumental in understanding recurrence, recurrence statistics, and quantitative mixing.

A plausible implication is that semi-random averages may be used to model transport, mixing, or relaxation in settings where neither full randomness nor full determinism are realistic; for instance, physical systems with structured but highly irregular scatterers or pseudo-random driving.

6. Proof Techniques and Methodological Innovations

Semi-random ergodic theorems leverage a range of advanced techniques:

• Transference principles reduce ergodic questions to uniform operator bounds in group or shift settings (Krause et al., 16 Apr 2025, LaVictoire et al., 2012).
• Calderón–Zygmund decomposition provides a path to weak-type maximal inequalities at $L^1$ (LaVictoire et al., 2012).
• Correlation decay, moment bounds, and covariance estimates (from mixing hypotheses) enable strong laws of large numbers in the absence of independence (Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).
• Van der Corput's method handles dependencies in Hilbert space, critical in higher-moment and multilinear averages.
• Bourgain-variation technology yields not only convergence but also explicit rates and size-vs-jump estimates in weak–$L^1$ contexts (Krause et al., 16 Apr 2025).
• Editor's term: "Lacunary-trick" arguments interpolate convergence along subsequences to global convergence, a pervasive device in almost-sure ergodic theory (Frantzikinakis et al., 2010, Donoso et al., 25 Feb 2025, Donoso et al., 22 Jan 2026).

7. Open Problems and Future Directions

Several principal challenges shape ongoing research:

• Pointwise convergence for deterministic, highly sparse subsequences (especially for $a_n = \lfloor n^c \rfloor$, $c \geq 8/7$) remains unresolved, as random or semi-random methods exploit statistical independence or decay not present in purely arithmetic sequences (Krause et al., 16 Apr 2025, Frantzikinakis et al., 2010).
• Extension to multidimensional or group actions beyond $\mathbb{Z}^d$, especially for deterministic models, is limited by combinatorial and analytical obstacles (LaVictoire et al., 2012).
• Refinement of quantitative regularity estimates (oscillation, variation, jump-counting) and extension to multilinear, nonconventional averages is an active area, particularly for blending dynamical and probabilistic dependencies (Donoso et al., 22 Jan 2026).

A plausible implication is that deeper understanding of semi-random ergodic averages will inform structural pseudo-randomness in arithmetic sequences, forging connections to number theory, statistical physics, and higher-order mixing phenomena in dynamical systems.