Green's classifications and evolutions of fixed-order networks (Q6161998)

Summary: It is shown that the set of all networks of fixed order \(n\) form a semigroup that is isomorphic to the semigroup \(B_X\) of binary relations on a set \(X\) of cardinality \(n\). Consequently, \(B_X\) provides for Green's \(\mathcal{L}\), \(\mathcal{R}\), \(\mathcal{H}\), and \(\mathcal{D}\) equivalence classifications of all networks of fixed order \(n\). These classifications reveal that a fixed-order network which evolves within a Green's equivalence class maintains certain structural invariants during its evolution. The ``Green's symmetry problem'' is introduced and is defined as the determination of all symmetries (i.e., transformations) that produce an evolution between an initial and final network within an \(\mathcal{L}\) or an \(\mathcal{R}\) class such that each symmetry preserves the required structural invariants. Such symmetries are shown to be solutions to special Boolean equations specific to each class. The satisfiability and computational complexity of the ``Green's symmetry problem'' are discussed and it is demonstrated that such symmetries encode information about which node neighborhoods in the initial network can be joined to form node neighborhoods in the final network such that the structural invariants required by the evolution are preserved, i.e., the internal dynamics of the evolution. The notion of ``propensity'' is also introduced. It is a measure of the tendency of node neighborhoods to join to form new neighborhoods during a network evolution and is used to define ``energy'', which quantifies the complexity of the internal dynamics of a network evolution.