Analysis of multivariate symbol statistics in primitive rational models
Massimiliano Goldwurm, Claudio Macci, Marco Vignati, Elena Villa
TL;DR
This work analyzes multivariate symbol-count statistics ${\bf Y}_n$ for words of length $n$ generated by a rational stochastic model with a primitive transition-weights matrix. It develops a quasi-power framework for the moment generating function, yielding precise asymptotics for means and covariances, a multivariate Gaussian limit with covariance $\Gamma$, a large deviation principle with speed $n$, and a novel moderate-deviation principle bridging the two regimes via the Gärtner–Ellis theorem. The results extend known univariate findings to the multivariate setting and provide a rigorous description of the fluctuation and tail behavior of symbol-count vectors in regular languages. The methods rely on Perron–Frobenius theory, analytic perturbations of $M({\bf t})$, and convex-analytic large deviation techniques with explicit rate functions.
Abstract
We study the asymptotic behaviour of sequences of multivariate random variables representing the number of occurrences of a given set of symbols in a word of length $n$ generated at random according to a rational stochastic model. Assuming primitive the matrix of the total weights of transitions of the model, we first determine asymptotic expressions for the mean values and the covariances of such statistics. Then we establish two asymptotic results that generalize known univariate cases to different regimes: a large deviation principle with speed $n$, implying almost sure convergence, and a multivariate Gaussian limit. Additionally, we introduce a novel moderate deviation result as a bridge between these regimes. Central to our proofs is a quasi-power property for the moment generating function of the statistics, allowing us to employ the Gärtner-Ellis Theorem for both large and moderate deviations.
