Random substitutions are a natural generalisation of their classical 'deterministic'counterpart
, whereby at every step of iterating the substitution, instead of replacing a letter with a …

We study regularity properties of frequency measures arising from random substitutions,
which are a generalisation of (deterministic) substitutions where the substituted image of …

We investigate topological mixing of compatible random substitutions. For primitive random
substitutions on two letters whose second eigenvalue is greater than one in modulus, we …

Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and
aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features …

We study various aspects of periodic points for random substitution subshifts. In order to do
so, we introduce a new property for random substitutions called the disjoint images …

We construct a family of ergodic measures on random substitution subshifts (RS-subshifts)
associated to a primitive random substitution. In particular, the word frequencies of every …

We consider word complexity and topological entropy for random substitution subshifts. In
contrast to previous work, we do not assume that the underlying random substitution is …

We introduce the concept of inflation word entropy for random substitutions with a constant
and primitive substitution matrix. Previous calculations of the topological entropy of such …

We consider a two-parameter family of random substitutions and show certain combinatorial
and topological properties they satisfy. We establish that they admit recognisable words at …

We prove that for a suitably nice class of random substitutions, their corresponding subshifts
have automorphism groups that contain an infinite simple subgroup and a copy of the …