Telegraph systems on networks and port-Hamiltonians. Ⅱ. Network realizability

Abstract

<p style='text-indent:20px;'>Hyperbolic systems on networks often can be written as systems of first order equations on an interval, coupled by transmission conditions at the endpoints, also called port-Hamiltonians. However, general results for the latter have been difficult to interpret in the network language. The aim of this paper is to derive conditions under which a port-Hamiltonian with general linear Kirchhoff's boundary conditions can be written as a system of <inline-formula><tex-math id="M1">\begin{document}$ 2\times 2 $\end{document}</tex-math></inline-formula> hyperbolic equations on a metric graph <inline-formula><tex-math id="M2">\begin{document}$ \Gamma $\end{document}</tex-math></inline-formula>. This is achieved by interpreting the matrix of the boundary conditions as a potential map of vertex connections of <inline-formula><tex-math id="M3">\begin{document}$ \Gamma $\end{document}</tex-math></inline-formula> and then showing that, under the derived assumptions, that matrix can be used to determine the adjacency matrix of <inline-formula><tex-math id="M4">\begin{document}$ \Gamma $\end{document}</tex-math></inline-formula>.</p>