Spectral Clustering Methods for Multiplex Networks

2017/03/15 by Daryl R. DeFord, DeFord, Daryl R., Scott D. Pauls +1 · 1 citation
Computer Science · Physics and Astronomy · #05C82 #FOS: Computer and information sciences #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #cs.SI #msc:05C82 #physics.soc-ph

paper · pdf · doi:10.48550/arxiv.1703.05355

22 pages, 3 figures

arxiv created 2017/03/15 · arxiv updated 2017/03/17

Abstract

Multiplex networks offer an important tool for the study of complex systems and extending techniques originally designed for single--layer networks is an important area of study. One of the most important methods for analyzing networks is clustering the nodes into communities that represent common connectivity patterns. In this paper we extend spectral clustering to multiplex structures and discuss some of the difficulties that arise in attempting to define a natural generalization. In order to analyze our approach, we describe three simple, synthetic multiplex networks and compare the performance of different multiplex models. Our results suggest that a dynamically motivated model is more successful than a structurally motivated model in discovering the appropriate communities.

Cited by

• Detecting Coordinated Activities Through Temporal, Multiplex, and Collaborative Analysis

Related

• Spectral Clustering for Multiple Sparse Networks: I
• General Community Detection with Optimal Recovery Conditions for Multi-relational Sparse Networks with Dependent Layers
• Spectral clustering via adaptive layer aggregation for multi-layer networks
• Clustering of Diverse Multiplex Networks
• Sparse Subspace Clustering in Diverse Multiplex Network Model