On Structured Random Matrices Defined by Matrix Substitutions

The structure of the random matrices introduced in this work is given by deterministic matrices—the skeletons of the random matrices—built with an algorithm of matrix substitutions with entries in a finite field of integers modulo some prime number, akin to the algorithm of one dimensional automatic sequences. A random matrix has the structure of a given skeleton if to the same number of an entry of the skeleton, in the finite field, it corresponds a random variable having, at least, as its expected value the correspondent value of the number in the finite field. Affine matrix substitutions are introduced and fixed point theorems are proven that allow the consideration of steady states of the structure which are essential for an efficient observation. For some more restricted classes of structured random matrices the parameter estimation of the entries is addressed, as well as the convergence in law and also some aspects of the spectral analysis of the random operators associated with the random matrix. Finally, aiming at possible applications, it is shown that there is a procedure to associate a canonical random surface to every random structured matrix of a certain class.