Spectral statistics for unitary transfer matrices of binary graphs

Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalize this approach by considering arbitrary, directed graphs with unitary transfer matrices. An exponentially increasing contribution to the form factor is identified when performing a diagonal summation over periodic orbit degeneracy classes. A special class of graphs, so-called binary graphs, is studied in more detail. For these, the conditions for periodic orbit pairs to be correlated (including correlations due to the unitarity of the transfer matrix) can be given explicitly. Using combinatorial techniques it is possible to perform the summation over correlated periodic orbit pair contributions to the form factor for some low-dimensional cases. Gradual convergence towards random matrix results is observed when increasing the number of vertices of the binary graphs.