Related papers: Superport networks
In this paper we show how to compute port behaviour of multiports which have port equations of the general form $B v_P - Q i_P = s,$ which cannot even be put into the hybrid form, indeed may have number of equations ranging from $0$ to…
The fundamental theory of energy networks in different energy forms is established following an in-depth analysis of the nature of energy for comprehensive energy utilization. The definition of an energy network is given. Combining the…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
Conservation laws and balance equations for physical network systems typically can be described with the aid of the incidence matrix of a directed graph, and an associated symmetric Laplacian matrix. Some basic examples are discussed, and…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
Using ideas from algebraic topology and statistical mechanics, we generalize Kirchhoff's network and matrix-tree theorems to finite CW complexes of arbitrary dimension. As an application, we give a formula expressing Reidemeister torsion as…
In this article we continue our investigations of one particle quantum scattering theory for Schroedinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The…
Recent advances in bipartite consensus on matrix-weighted networks, where agents are divided into two disjoint sets with those in the same set agreeing on a certain value and those in different sets converging to opposite values, have…
The paper is concerned with a system of linear hyperbolic differential equations on a network coupled through general transmission conditions of Kirchhoff's type at the nodes. We discuss the reduction of such a problem to a system of…
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…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
Transmission line failures in power systems propagate non-locally, making the control of the resulting outages extremely difficult. In this work, we establish a mathematical theory that characterizes the patterns of line failure propagation…
Continuous-time Markov chains have been successful in modelling systems across numerous fields, with currents being fundamental entities that describe the flows of energy, particles, individuals, chemical species, information, or other…
A natural extension of the Dijkgraaf-Vafa proposal is to include fields in the fundamental representation of the gauge group. In this paper we use field theory techniques to analyze gauge theories whose tree level superpotential is a…
Using local detailed balance we rewrite the Kirchhoff formula for stationary distribution of Markov jump processes in terms of a physically interpretable tree-ensemble. We use that arborification of path-space integration to derive a…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the…
In this paper, we define the notion of rigidity for linear electrical multiports and for matroid pairs. We show the parallel between the two and study the consequences of this parallel. We present applications to testing, using purely…
This paper contains results relating currents and voltages in resistive networks to appropriate random trees or forests in those networks.