LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Approximations of Metric Graphs by Thick Graphs and Their Laplacians

Photo from wikipedia

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… Click to show full abstract

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.

Keywords: graphs; approximations metric; thick graphs; metric graphs; metric graph

Journal Title: Symmetry
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.