Linear Software Models: Bipartite Isomorphism between Laplacian Eigenvectors and Modularity Matrix Eigenvectors

Abstract

We have recently shown that one can obtain the numbers and sizes of modules of a software system from the eigenvectors of its modularity matrix symmetrized and weighted by an affinity matrix. However such a weighting still demands a suitable definition of an affinity. This paper offers an alternative way to obtain the same results by means of the eigenvectors of a Laplacian matrix, directly obtained from the modularity matrix without the need of weighting. These two formalizations stand in a mutual isomorphism. We call it bipartite isomorphism since it is most straightforwardly shown by deriving the Laplacian from the modularity matrix and vice versa through the intermediate bipartite graph between two separate sets: the structors’ and the functionals’ sets. This isomorphism is also demonstrated through the equation defining the Laplacian in terms of the modularity matrix, or by the direct mapping of the respective matrices’ eigenvectors. Both matrices and the bipartite graph reflect one central idea: modules are connected components with high cohesion. The Laplacian matrix technique, of which the Fiedler vector is of central importance, is illustrated by case studies. An important claim of this paper is that, independently of the modularity matrix- and Laplacian matrix-specific properties, behind these two alternative matrices there is just one unified algebraic theory of software composition — the Linear Software Models — here concerning the application of the matrices’ eigenvectors to software modularity.

A Software System is Greater than its Modules Sum: Providers and Consumers Modularity Matrix

“…Exman and Sakhnini [13], [14] have shown how to generate a Laplacian Matrix from the Modularity Matrix. The Laplacian matrix obtains the same modules as the Modularity Matrix, by similar spectral methods.…”

“…As a last step towards the modules of the whole Command Pattern system, including both providers and consumers, we apply the same algebraic spectral method previously used (in [14]) for the providers-only Laplacian. It consists of: Fig.…”

“…Linear Software Models represent each abstraction level of a given Software System by means of a Modularity Matrix [8], [10] or its corresponding Laplacian Matrix [13], [14]. These models enable rigorous software design of any given system:…”

Algebraic Convergence to Software-Knowledge: Deep Software Learning (P)

“…Software Models Software composition algebraic theory formalizes Brooks' Conceptual Integrity idea. Software is a hierarchical system, where each level is represented by a Modularity Matrix [3], [4]. Matrix columns stand for structural units, object-oriented classes, and matrix rows for functional units, i.e.…”

“…Modularity matrices may have outliers coupling between modules. Spectral methods for the Modularity Matrix [3], or the respective Laplacian Matrix [4], resolve couplings. A Laplacian obtains the same modules as the Modularity Matrix.…”