Walk generating functions and spectral measures of infinite graphs (Q1108292): Difference between revisions

This paper concerns spectra of, and spectral measures on, infinite graphs with bounded vertex degrees. The adjacency matrix of such a graph gives rise to a bounded self-adjoint operator A on square summable sequences indexed by the vertices. The function \(\mu_{uv}(\lambda)=(E(\lambda)e_ u,e_ v)\)- where E(\(\lambda)\) is the resolution of the identity for A and \(e_ u\) is the sequence whose only nonzero coordinate is a 1 corresponding to vertex u - is called the spectral measure corresponding to the vertices u, v. The spectral measures, the resolvent and the walk generating matrix are closely related. The spectral measures are used to characterize bipartite graphs in terms of their spectra. For a class of graphs that includes Cayley graphs, a closed-walk generating function and an average spectral measure can be defined. Limit theorems are introduced that permit calculation of expected eigenvalue distributions for large, finite, random, regular or bipartite semiregular graphs and spectral measures of many important infinite graphs. Examples included are distance-regular graps, semiregular trees, infinite path and hexagonal chain.