The Circle That Never Ends: Can Complexity be Made Simple? 127
directed graph or digraph. The linear graph or the digraph corresponding
to a network is an embodiment of that network’s topology or connectedness.
For practical purposes, the constitutive relations describing the network
elements and the topology of the network can be formalized independently
and then combined to furnish a solution to the network. A network has
a solution when all the observables in that network can be specified. The
nature of the solution is a system trajectory. The formulation of the network
is a set of coupled differential equations of motion.
Drawing the branches in the form of a connected set of lines or arrows
with dots representing the nodes at the ends of the branches where the
connections occur can diagram the formal representation of a network.
This diagram is an application of graph theory, which is a part of topology.
By numbering the nodes and branches, another, equivalent representa-
tion is possible. This labeling system allows the construction of an inci-
dence matrix, A. The incidence matrix has its columns numbered by the
node numbers and its rows numbered by the branch numbers and the result-
ing matrix becomes an array of zeros and ones. In a linear (non-directed)
graph only positive ones would appear and then only at the node/branch
combinations where the node and branch were incident upon each other
(the node is the end of that branch.) In a digraph a convention is adopted so
that if the branch is incident on a node leaving the node it gets the opposite
algebraic sign from the branch incident on a node entering that node. Using
this definition, the linear graph representing the network’s topology can be
used to create the incidence matrix which is, in general a b × k array of
zeros and plus or minus ones, where b is the number of branches and k the
number of nodes. In turn, any incidence matrix has a unique realization in
a linear graph. In other words they each can be used to generate the other.
The incidence matrix, by its nature, is a computational tool. This is easily
demonstrated by the application of it as a representation of the networks
topology to implement Kirchhoff’s Laws [121]. These laws reflect two
fundamental constraints on physical systems. They are consistent with the
analogs developed among the different processes in that they apply equally
well to all of them. The generalized version of the laws that had first been
developed for electronic networks is:
Kirchhoff’s Flow Law (KCL for Kirchoff’s Current law) states that
at any node in the network all flows sum to zero given that incoming
flows have the opposite sign from outgoing flows. This is a simple state-
ment of conservation for the flowing quantity (mass, charge, volume in an