Maximal assortative matching for complex

• Main Author: Natarajan Meghanathan
• Format: Article
• Language: English
• Published: Elsevier 2016-04-01
• Series: Journal of King Saud University: Computer and Information Sciences
• Subjects: Maximal matching; Assortative matching; Dissortative matching; Assortativity index; Complex networks; Node similarity
• Online Access: http://www.sciencedirect.com/science/article/pii/S1319157815001238

We define the problem of maximal assortativity matching (MAM) for a complex network graph as the problem of maximizing the similarity of the end vertices (with respect to some measure of node weight) constituting the matching. In this pursuit, we introduce a metric called the assortativity weight of an edge, defined as the product of the number of uncovered adjacent edges and the absolute value of the difference in the weights of the end vertices. The MAM algorithm prefers to include edges that have the smallest assortativity weight in each iteration (one edge per iteration) until all edges are covered. The MAM algorithm can also be adapted to determine a maximal dissortative matching (MDM) to maximize the dissimilarity between the end vertices that are part of a matching as well as to determine a maximal node matching (MNM) that simply maximizes the number of vertices that are part of the matching. We run the MAM, MNM and MDM algorithms on real-world network graphs as well as on the theoretical model-based random network graphs and scale-free network graphs and analyze the tradeoffs between the % of node matches and assortativity index (targeted optimal values: 1 for MAM and −1 for MDM).