Abstract
Let Γ be a locally finite graph, L the normalized Laplacian of Γ. If Γ is uniformly locally finite, i.e. if each vertex has no more than d adjacent vertices, then the matrix of L (with respect to the standard basis) has no more than d+1 non-zero entries in each row and in each column. We consider the class of locally finite graphs, for which the Laplacian can be approximated, with respect to the operator norm, by matrices of this type with arbitrary d. We provide examples of locally finite graphs which are or are not in this class, and show that the graphs from this class share certain regularity property: vertices of high degree cannot have too many adjacent vertices of low degree.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
