Related papers: Ergodic properties of randomly coloured point sets

Given a heterogeneous time-series sample, the objective is to find points in time (called change points) where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown…

Convergence properties of random ergodic averages have been extensively studied in the literature. In these notes, we exploit a uniform estimate by Cohen \& Cuny who showed convergence of a series along randomly perturbed times for…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

We present a method, based on commutator methods, for the spectral analysis of uniquely ergodic dynamical systems. When applicable, it leads to the absolute continuity of the spectrum of the corresponding unitary operators. As an…

We prove ergodicity of unitary random-matrix theories by showing that the autocorrelation function with respect to energy or magnetic field strength of any observable vanishes asymptotically. We do so using Efetov's supersymmetry method, a…

Exponential-family random graph models (ERGMs) are probabilistic network models that are parametrized by sufficient statistics based on structural (i.e., graph-theoretic) properties. The ergm package for the R statistical computing system…

We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a…

Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…

We study strictly ergodic Delone dynamical systems and prove an ergodic theorem for Banach space valued functions on the associated set of pattern classes. As an application, we prove existence of the integrated density of states in the…

The aim of this article is to obtain a better understanding and classification of strictly ergodic topological dynamical systems with discrete spectrum. To that end, we first determine when an isomorphic maximal equicontinuous factor map of…

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large…

The mathematical definitions of distinct concepts that are needed in building an ergodicity detection algorithm are introduced in a framework. This algorithmic framework is expressed in a discrete setting in an accessible manner for broader…

We establish a sufficient condition for a continuous map, acting on a compact metric space, to have a Baire residual set of points exhibiting historic behavior (also known as irregular points). This criterion applies, for instance, to a…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that…

We introduce probabilistic neural networks that describe unsupervised synchronous learning on an atomic Hardy space and space of bounded real analytic functions, respectively. For a stationary ergodic vector process, we prove that the…

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…

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…

Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…