A Generalized Approach to Complex Networks

Abstract

This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the network topology to new network growth models. First, the concepts of node degree and clustering coefficient are extended in order to characterize not only specific nodes, but any generic subnetwork. Second, the consideration of distance transform and rings are used to further extend those concepts in order to obtain a signature, instead of a single scalar measurement, ranging from the single node to whole graph scales. The enhanced discriminative potential of such extended measurements is illustrated with respect to the identification of correspondence between nodes in two complex networks, namely a protein-protein interaction network and a perturbed version of it. The use of other measurements derived from mathematical morphology are also suggested as a means to characterize complex networks connectivity in a more comprehensive fashion.

10 pages, 2 figure

Cited by in corpus (11)

• Characterization of complex networks: A survey of measurements
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• The rich-club phenomenon across complex network hierarchies
• Hierarchical characterization of complex networks
• Chain motifs: The tails and handles of complex networks
• Concentric Characterization and Classification of Complex Network Nodes: Theory and Application to Institutional Collaboration
• What are the Best Hierarchical Descriptors for Complex Networks?
• Characterization of Subgraphs Relationships and Distribution in Complex Networks
• Flow Motifs Reveal Limitations of the Static Framework to Represent Human interactions
• Analyzing Trails in Complex Networks
• 2D pattern evolution constrained by complex network dynamics