Norms, Kernels and Eigenvalues of some Infinite Graphs
Abstract
In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the Lp space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of the kernel of some infinite trees, and we find the eigenvalues of certain infinite graphs obtained by attaching an infinite tail to some finite graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.