2021
DOI: 10.1007/s00208-021-02215-5
|View full text |Cite
|
Sign up to set email alerts
|

Heat kernels on forms defined on a subgraph of a complete graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…Corollary 10 is particularly interesting since it gives a precise relation between the graph heat kernel on a graph G which is embedded in a domain Ω in terms of the geometric heat kernel associated to Ω, up to O(t 2 ) for small time t. Section 5 deals with derivation of expressions for the heat kernel in a general subgraph case. In Section 6 we show that our general result, applied to the setting of the complete graph on N vertices yields some of the main results from Section 3 of [LNY21]. We also give an alternative formulation for those results and explicitly compute the heat kernel on the graph obtained by removing a single edge from the complete graph.…”
Section: Introductionmentioning
confidence: 80%
See 4 more Smart Citations
“…Corollary 10 is particularly interesting since it gives a precise relation between the graph heat kernel on a graph G which is embedded in a domain Ω in terms of the geometric heat kernel associated to Ω, up to O(t 2 ) for small time t. Section 5 deals with derivation of expressions for the heat kernel in a general subgraph case. In Section 6 we show that our general result, applied to the setting of the complete graph on N vertices yields some of the main results from Section 3 of [LNY21]. We also give an alternative formulation for those results and explicitly compute the heat kernel on the graph obtained by removing a single edge from the complete graph.…”
Section: Introductionmentioning
confidence: 80%
“…Throughout this section we will employ some of the same considerations as in [LNY21], namely in the explicit computation of the graph convolution. In doing so, we will show the relationship between our Theorem 5 and Theorem 3.3 of [LNY21]. Let K N denote the complete graph K N on N vertices.…”
Section: A Subgraph Of the Complete Graph On N Verticesmentioning
confidence: 99%
See 3 more Smart Citations