The spectra of graph substitutions
Thomas Hirschler, Wolfgang Woess

TL;DR
This paper characterizes the spectrum of graph substitution constructions using normalized adjacency matrices, linking the spectral properties of the substituted graph to those of the original graphs and the substitution graph.
Contribution
It provides a detailed spectral analysis of graph substitutions with automorphisms, extending to reversible transition matrices and including eigenvalue multiplicities.
Findings
Main spectrum part responds to substitution via a rational function.
Eigenvalues of the substitution graph influence the spectrum.
Eigenfunctions relate to nodal sets of the original graph.
Abstract
Let and be finite connected graphs without loops. We assume that has two distinguished vertices and an automorphism which exchanges and~. The -edge substitution of is the graph where each edge is replaced by a copy of , identifying with and with or vice versa. (The latter choice does not matter; it yields isomorphic graphs.) The aim is to describe the spectrum of in terms of the spectra of and . Instead of the spectra of the adjacency matrices, we consider the versions which are normalised by dividing each row by the row sum (the vertex degree). These are stochastic, reversible matrices, and our approach applies more generally to reversible transition matrices corresponding to arbitrary positive edge weights invariant under . We write for the transition matrix over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
