On metric graphs with one absorbing point, the path graph maximizes heat content at sufficiently small and sufficiently large times.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.SP 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Faber-Krahn inequality for the heat content on quantum graphs via random walk expansion
On metric graphs with one absorbing point, the path graph maximizes heat content at sufficiently small and sufficiently large times.