Spectral measures and dominant vertices in graphs of bounded degree
Claire Bruchez, Pierre de la Harpe, and Tatiana Nagnibeda

TL;DR
This paper explores the spectral measures associated with vertices in bounded degree graphs, demonstrating the diverse behaviors of dominance among vertices, including cases with all, some, or no dominant vertices.
Contribution
It characterizes the conditions under which vertices in bounded degree graphs are dominant or not, revealing the full spectrum of possible dominance configurations.
Findings
Vertex-transitive graphs have all vertices dominant.
Some graphs have only a subset of dominant vertices.
Certain graphs lack any dominant vertices.
Abstract
A graph of bounded degree has an adjacency operator~ which acts on the Hilbert space . There are different kinds of measures of interest on the spectrum of . In particular, each vector defines a local spectral measure at on ; therefore each vertex defines a vector and the associated measure on . A vertex is dominant if, for all , the measure is absolutely continuous with respect to (it then follows that, for all , the measure is absolutely continuous with respect to ). The main object of this paper is to show that all possibilities occur: in some graphs, for example in vertex-transitive graphs, all vertices are dominant; in other graphs, only some vertices are dominant; and there…
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.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · Magnetism in coordination complexes
