Eigenvector localization as a tool to study small communities in online social networks

Abstract

We present and discuss a mathematical procedure for identification of small "communities" or segments within large bipartite networks. The procedure is based on spectral analysis of the matrix encoding network structure. The principal tool here is localization of eigenvectors of the matrix, by means of which the relevant network segments become visible. We exemplified our approach by analyzing the data related to product reviewing on Amazon.com. We found several segments, a kind of hybrid communities of densely interlinked reviewers and products, which we were able to meaningfully interpret in terms of the type and thematic categorization of reviewed items. The method provides a complementary approach to other ways of community detection, typically aiming at identification of large network modules.

References in corpus (10)

• Uncovering the overlapping community structure of complex networks in nature and society
• Finding community structure in networks using the eigenvectors of matrices
• Detecting the overlapping and hierarchical community structure of complex networks
• Modularity and community detection in bipartite networks
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• Spectral Density of Complex Networks with a Finite Mean Degree
• Spectral methods and cluster structure in correlation-based networks
• Spectrum, Intensity and Coherence in Weighted Networks of a Financial Market
• Netons: Vibrations of Complex Networks