Related papers: Degree lowering for ergodic averages along arithme…

The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…

Explicit calculations in dimension one show for Schur stable autoregressive processes with standard Gaussian noise that the ergodic convergence in the Wasserstein-$2$ distance is essentially given by the sum of the mean, which decays…

Various forms of the polynomial ergodic theorem (PET) which attracted substantial attention in ergodic theory study the limits of expressions having the form $1/N\sum_{n=1}^NT^{q_1(n)}f_1... T^{q_\ell (n)}f_\ell$ where $T$ is a weakly…

It was shown by S. Kalikow and B. Weiss that, given a measure-preserving action of $\mathbb{Z}^d$ on a probability space $X$ and a nonnegative measurable function $f$ on $X$, the probability that the sequence of ergodic averages $$ \frac 1…

In ergodic singular stochastic control problems, a decision-maker can instantaneously adjust the evolution of a state variable using a control of bounded variation, with the goal of minimizing a long-term average cost functional. The cost…

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean…

We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

We present a survey of ergodic theorems for actions of algebraic and arithmetic groups recently established by the authors, as well as some of their applications. Our approach is based on spectral methods employing the unitary…

We endow the set of all invariant measures of a topological dynamical system with a metric $\bar{\rho}$, which induces a topology stronger than the the weak$^*$-topology. Then, we study the closedness of ergodic measures within a…

We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal H$ be such a class, and for $H\in\mathcal H$ write $\Delta(H)$ and $d(H)$ for the maximum degree and average degree of $H$, respectively. We…

Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval…

We propose an extension of ergodic theory which focuses on the identification of ergodicity in terms of the uniqueness of the invariant measure. We first explain the concept for the doubling maps, which can be analyzed using Fourier…

A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

We obtain upper bounds for the estimation error of Kernel Ridge Regression (KRR) for all non-negative regularization parameters, offering a geometric perspective on various phenomena in KRR. As applications: 1. We address the multiple…

We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a…

We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in particular, that the cop number of any graph with girth $g$ and…

We derive a simple and model-independent formula for the change in the generalization gap due to a gradient descent update. We then compare the change in the test error for stochastic gradient descent to the change in test error from an…

Stationary ergodic processes with finite alphabets are estimated by finite memory processes from a sample, an n-length realization of the process, where the memory depth of the estimator process is also estimated from the sample using…