For a finite connected graph with the boundary set ∂G from [57], the paper proves analogues of Pólya's hitting-time bound, Faber-Krahn, Hardy, Alexandrov-Bakelman-Pucci, hot spots stability, and Björck's theorem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Potential Theory and the Boundary of Combinatorial Graphs
For a finite connected graph with the boundary set ∂G from [57], the paper proves analogues of Pólya's hitting-time bound, Faber-Krahn, Hardy, Alexandrov-Bakelman-Pucci, hot spots stability, and Björck's theorem.