We briefly present ongoing work about Martin-Löf randomness and the ergodic decomposition theorem. In [ML66], Martin-Löf defined the notion of an algorithmically random infinite binary sequence. The idea was to have an individual notion of a random object, an object that is acceptable as an outcome of a probabilistic process (typically, the tossing of a coin). This notion has proved successful,...

We consider Delone sets with finite local complexity. We characterize validity of a subadditive ergodic theorem by uniform positivity of certain weights. The latter can be considered to be an averaged version of linear repetitivity. In fact, it is shown that linear repetitivity is equivalent to positivity of weights combined with a certain repulsion property of patterns and a balancedness of th...

Measure-preserving systems arise in a variety of contexts, such as probability theory, information theory, and of course in the study of dynamical systems. However, ergodic theory originated from statistical mechanics. In this setting, T represents the evolution of the system through time. Given a measurable function f : X → R, the series of values f(x), f(Tx), f(T x)... are the values of a phy...