Pure point spectrum of the Laplacians on fractal graphs (Q1891831): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jfan.1995.1056 / rank
Normal rank
 
Property / author
 
Property / author: Leonid A. Malozemov / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Georgi E. Karadzhov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jfan.1995.1056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063406007 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JFAN.1995.1056 / rank
 
Normal rank

Latest revision as of 12:10, 16 December 2024

scientific article
Language Label Description Also known as
English
Pure point spectrum of the Laplacians on fractal graphs
scientific article

    Statements

    Pure point spectrum of the Laplacians on fractal graphs (English)
    0 references
    0 references
    0 references
    14 June 1995
    0 references
    On two-point self-similar fractal graphs the authors consider Laplacians which correspond to the adjacency matrix and the simple random walk. Roughly speaking, it is proven that if the graph has an infinite number of cycles and the length of these cycles approaches infinity, then the spectrum is pure point and all eigenvalues have infinite multiplicity. It is also shown that a countable set of orthonormal eigenfunctions with compact support is complete.
    0 references
    fractal graphs
    0 references
    Laplacians
    0 references
    cycles
    0 references
    spectrum
    0 references
    eigenvalues
    0 references
    orthonormal eigenfunctions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references