Approximations of Metric Graphs by Thick Graphs and Their Laplacians
Keyword(s):
The main purpose of this article is two-fold: first, to justify the choice of Kirchhoff vertex conditions on a metric graph as they appear naturally as a limit of Neumann Laplacians on a family of open sets shrinking to the metric graph (“thick graphs”) in a self-contained presentation; second, to show that the metric graph example is close to a physically more realistic model where the edges have a thin, but positive thickness. The tool used is a generalization of norm resolvent convergence to the case when the underlying spaces vary. Finally, we give some hints about how to extend these convergence results to some mild non-linear operators.
2011 ◽
pp. 146-152
2019 ◽
Vol 99
(03)
◽
pp. 508-520
2010 ◽
Vol 43
(15)
◽
pp. 155204
◽
1984 ◽
Vol 96
(1-2)
◽
pp. 135-142
◽
Keyword(s):
2017 ◽
Vol 2019
(7)
◽
pp. 2204-2222
◽
1997 ◽
Vol 39
(1)
◽
pp. 1-27
◽
1978 ◽
Vol 18
(2)
◽
pp. 7-15