2025/06/04 by Grebík, Jan, Král', Daniel, Liu, Xizhi +2 · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2506.04426
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness of the linear operator associated with a graphon. In this short paper, we consider the setting of digraphons, which are limits of directed graphs, and prove that the spectra of convergent digraphons converge. Using this result, we establish the relation between densities of directed cycles and the spectrum of a digraphon.