On the accuracy of matrix-graph approach to investigation of transformation mixing properties

Experimental results of evaluating the accuracy of matrix-graph approach to investigation of nonlinear transformation mixing properties are obtained. The experiment has been carried out with all those transformations of the binary $n$-dimensional vectors set, for which the mixing graph is the Wielandt graph with $n$ vertices, and also with the round substitutions used in AES, Kuznechik, and Magma block ciphers. It is shown that results obtained by matrix-graph approach are accurate for 25 % of transformations with the mixing Wielandt graph (for $n=9,10,11$) and for round substitutions in AES and Kuznechik algorithms. The results are not accurate for round substitution in Magma algorithm and for 75 % of transformations with the mixing Wielandt graph.