A combinatorial view on star moments of regular directed graphs and trees

TL;DR

This paper studies the moments of adjacency matrices of regular directed graphs and trees, providing a combinatorial approach that links these moments to non-crossing partitions and extends classical results to directed settings.

Contribution

It introduces a combinatorial derivation for star moments of regular directed trees, connecting these moments to non-crossing partitions and generalizing previous undirected graph results.

Findings

Derived a formula for star moments in regular directed trees

Connected moments to non-crossing partitions compatible with word structure

Extended classical moment methods to directed graph settings

Abstract

We investigate the method of moments for $d$-regular digraphs and the limiting $d$-regular directed tree $T_d$ as the number of vertices tends to infinity, in the same spirit as McKay (Linear Algebra Appl., 1981) for the undirected setting. In particular, we provide a combinatorial derivation of the formula for the star moments (from a root vertex $o\in T_d$) $$M_d(w)\qquad:=\sum_{\substack{v_0,v_1\ldots,v_{k-1},v_k\in T_d\\v_0=v_k=o}} A^{w_1}(v_0,v_1)A^{w_2}(v_1,v_2) \cdots A^{w_k}(v_{k-1},v_k)$$ with $A$ the adjacency matrix of $T_d$, where $w:=w_1\cdots w_k$ is any word on the alphabet $\{1,{*}\}$ and $A^*$ is the adjoint matrix of $A$. Our analysis highlights a connection between the non-zero summands of $M_d(w)$ and the non-crossing partitions of $\{1,\ldots,k\}$ which are in some sense compatible with $w$.