On adjacency operators of locally finite graphs
Vladimir I. Trofimov

TL;DR
This paper develops a comprehensive theory of eigenvalues and eigenfunctions for adjacency operators on infinite locally finite graphs, extending finite graph spectral theory to more general infinite cases, especially for connected graphs with bounded degrees over complex numbers.
Contribution
It introduces a general framework for analyzing eigenvalues and eigenfunctions of adjacency operators on infinite locally finite graphs, surpassing previous limited approaches.
Findings
Extended spectral theory to infinite graphs with bounded degrees
Provided new characterizations of eigenvalues and eigenfunctions
Enhanced understanding of adjacency operators in infinite graph contexts
Abstract
A graph is called locally finite if, for each vertex of , the set of all neighbors of in is finite. For any locally finite graph with vertex set and for any field , let be the vector space over of all functions (with natural componentwise operations) and let be the linear operator defined by for all , . In the case of finite graph the mapping is the well known operator defined by the adjacency matrix of (over ), and the theory of eigenvalues and eigenfunctions of such operator is a well-developed (at least in the case ) part of the theory of finite…
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 · Matrix Theory and Algorithms · Finite Group Theory Research
