Laplacians on infinite graphs: discrete vs. continuous (Q6064562)

From MaRDI portal
scientific article; zbMATH DE number 7763394
Language Label Description Also known as
English
Laplacians on infinite graphs: discrete vs. continuous
scientific article; zbMATH DE number 7763394

    Statements

    Laplacians on infinite graphs: discrete vs. continuous (English)
    0 references
    0 references
    0 references
    10 November 2023
    0 references
    Summary: There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to several diverse branches of mathematics and mathematical physics. The existing literature usually treats these two Laplacian operators separately. In this overview, we will focus on the relationship between them (spectral and parabolic properties). Our main conceptual message is that these two settings should be regarded as complementary (rather than opposite) and exactly their interplay leads to important further insight on both sides. For the entire collection see [Zbl 1519.00033].
    0 references
    graph
    0 references
    metric graph
    0 references
    Laplacian
    0 references
    intrinsic metric
    0 references
    random walk
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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