Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological entropy) and are uniquely ergodic. Random substitutions are a generalisation of deterministic substitutions where the substituted image of a letter is determined by a Markov process. In stark contrast to their deterministic counterparts, subshifts of random substitutions often have positive topological entropy, and support uncountably many ergodic measures. The underlying Markov process singles out one of the ergodic measures, called the frequency measure. Here, we develop new techniques for computing and s...