Heat kernel and Green kernel comparison theorems for infinite graphs (Q1355465)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Heat kernel and Green kernel comparison theorems for infinite graphs
scientific article

    Statements

    Heat kernel and Green kernel comparison theorems for infinite graphs (English)
    0 references
    0 references
    27 August 1997
    0 references
    In author's words: ``For an infinite graph, general lower and upper estimates of the Green kernel and heat kernel are given. The estimates are optimal in the case of the homogeneous regular trees.'' In order to obtain this estimates some other interesting results are given: the maximum principle for the heat equation (cf. Lemma 3.1), the heat kernel comparison theorem for an infinite tree (cf. Theorem 3.6), the behaviour of heat kernel and Green kernel of a finite graph with boundary (cf. Section 4). The main results appear in Section 5 (Theorem 5.12 for lower estimates) and Section 6 (Theorem 6.6 for upper estimates). The last two sections contain many applications. So, in Section 7.1 estimates of the Green kernel are given by means of the maximum or minimum of degrees, in Section 7.2 is proved the solvability of the Dirichlet problem for the end compactification and in Section 8 are determinated or given estimates for infinite graphs containing the so-called distance regular graphs \(D_{m,s}\), and the free product of finite complete graphs \(K_r\) and \(K_s\), \(K_r \ast K_s\), and the one of two circles of odd lengths \(r\) and \(s\), \(C_r \ast C_s\).
    0 references
    0 references
    0 references
    0 references
    0 references
    heat kernel
    0 references
    Green kernel
    0 references
    infinite graph
    0 references
    0 references