Ergodic properties of randomly coloured point sets

TL;DR

This paper develops a framework to analyze the ergodic properties of randomly coloured point sets in certain mathematical spaces, with applications to coloured graphs, providing new insights into their statistical regularities.

Contribution

It introduces a comprehensive framework for studying randomly coloured point sets, including ergodic theorems and geometric characterizations, extending previous models to incorporate random colourings.

Findings

Characterization of ergodicity via pattern frequencies for finite local complexity

Derivation of an ergodic theorem for randomly coloured point sets with finite-range dependencies

Application framework for randomly coloured graphs

Abstract

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical system for uniformly discrete uncoloured point sets. For point sets of finite local complexity, we characterise ergodicity geometrically in terms of pattern frequencies. The general framework allows to incorporate a random colouring of the point sets. We derive an ergodic theorem for randomly coloured point sets with finite-range dependencies. Special attention is paid to the exclusion of exceptional instances for uniquely ergodic systems. The setup allows for a straightforward application to randomly coloured graphs.