Edinburgh Research Archive

Differential equations on metric graphs: continuum and numerical methods

dc.contributor.advisor
Vasil, Geoff
dc.contributor.advisor
Morozov, Alexander
dc.contributor.author
Holden, Sidney
dc.date.accessioned
2024-11-06T15:21:53Z
dc.date.available
2024-11-06T15:21:53Z
dc.date.issued
2024-11-06
dc.description.abstract
Continuum modelling has proven exceedingly useful throughout science by assuming the infinite divisibility of a given system. However, high-density metric graphs—representing a range of natural and engineered systems—have seen limited modelling in this way. A metric graph is what one might expect intuitively: a spiderweb, neuronal network, water-supply system, or the British Rail. Physical continuity allows for one-dimensional differential equations along each edge. At vertices, solutions satisfy flux-balance conditions. We study the eigenvalues and eigenfunctions of the Laplace operator on an increasingly dense graph within a prescribed embedding space, e.g., a spiderweb filling the unit disc. The continuous, linear eigenvalue problem on the edges reduces to a discrete, nonlinear eigenvalue problem on the vertices. Numerically, solutions require a novel matrix-determinant root-finding algorithm. Alternatively, the discrete system becomes the eigenvalue equation of a continuous partial differential operator, resembling a Laplace--Beltrami operator but with several notable differences. Rather than a Riemannian metric, we derive a distinct symmetric tensor that scales linearly with distance. Rather than the determinant-based volume form, we find an analogous matrix-trace-based distance form. Our findings open the possibility for a new manifold geometry similar to geodesic structure but made from underlying “graph material”. We discuss a series of examples of high-density networks, comparing PDE solutions to numerical solutions of vertex systems. We start with trivial cases and proceed to inhomogeneous and anisotropic media. We develop continuum models for random graphs, hierarchical networks, and cases of nonuniform edge conductances and capacities.
en
dc.identifier.uri
https://hdl.handle.net/1842/42617
dc.identifier.uri
http://dx.doi.org/10.7488/era/5311
dc.language.iso
en
en
dc.publisher
The University of Edinburgh
en
dc.subject
Differential equations
en
dc.subject
metric graphs
en
dc.subject
Continuum modelling
en
dc.subject
Physical continuity
en
dc.subject
one-dimensional differential equation
en
dc.subject
Laplace–Beltrami operator
en
dc.subject
high-density networks
en
dc.subject
PDE solutions
en
dc.subject
vertex systems
en
dc.subject
nonuniform edge
en
dc.subject
random graphs
en
dc.subject
hierarchical networks
en
dc.title
Differential equations on metric graphs: continuum and numerical methods
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en

Files

Original bundle

Now showing 1 - 1 of 1
Name:
HoldenS_2024.pdf
Size:
81.82 MB
Format:
Adobe Portable Document Format
Description:

This item appears in the following Collection(s)