Related papers: Automatic sequences as good weights for ergodic th…
The classical Multiplicative Ergodic Theorem (MET) of Oseledets is generalized here to cocycles taking values in a semi-finite von Neumann algebra. This allows for a continuous Lyapunov distribution.
We investigate topological and ergodic properties of cellular automata having equicontinuity points. In this class surjectivity on a transitive SFT implies existence of a dense set of periodic points. Our main result is that under the…
We prove pointwise convergence, as $N\to \infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f(T^nx)\cdot g(S^{a_n}x)$, where $T$ and $S$ are commuting measure preserving transformations, and $a_n$ is a random version of the…
In this paper we study multiple ergodic averages for "good" variable polynomials. In particular, under an additional assumption, we show that these averages converge to the expected limit, making progress related to an open problem posted…
Local mean and individual (with respect to almost uniform convergence in Egorov's sense) ergodic theorems are established for actions of the semigroup $\mathbb R_+^d$ in symmetric spaces of measurable operators associated with a semifinite…
The classical Birkhoff ergodic theorem in its most popular version says that the time average along a single typical trajectory of a dynamical system is equal to the space average with respect to the ergodic invariant distribution. This…
This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This…
The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…
We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.
In discrete-time linear dynamical systems (LDSs), a linear map is repeatedly applied to an initial vector yielding a sequence of vectors called the orbit of the system. A weight function assigning weights to the points in the orbit can be…
We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique…
We consider dynamics of scalar semilinear parabolic equations on bounded intervals with periodic boundary conditions, and on the entire real line, with a general nonlinearity $g(t,x,u,u_x)$ either not depending on $t$, or periodic in $t$.…
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing…
We study the ergodic and statistical properties of a class of maps of the circle and of the interval of Lorenz type which present indifferent fixed points and points with unbounded derivative. These maps have been previously investigated in…
Research of delayed neural networks with variable self-inhibitions, inter-connection weights, and inputs is an important issue. %In the real world, self-inhibitions, %inter-connection weights, and inputs should vary through time. In In this…
Denote by $\Gamma$ the set of pointwise good sequences. Those are sequences of real numbers $(a_k)$ such that for any measure preserving flow $(U_t)_{t\in \mathbb R}$ on a probability space and for any $f\in L^\infty$, the averages…
We present a new proof of an Ergodic theorem for Wide-Sense Stationary Random Processes added with a new canonical sampling theorem of mine for finite time duration signals in the frequency domain (periodograms) which is free from the…
This work examines the deep disconnect between existing theoretical analyses of gradient-based algorithms and the practice of training deep neural networks. Specifically, we provide numerical evidence that in large-scale neural network…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
The well-known Jewett-Krieger's Theorem states that each ergodic system has a strictly ergodic model. Strengthening the model by requiring that it is strictly ergodic under some group actions, and building the connection of the new model…