Detecting network communities beyond assortativity-related attributes

Abstract

In network science, assortativity refers to the tendency of links to exist between nodes with similar attributes. In social networks, for example, links tend to exist between individuals of similar age, nationality, location, race, income, educational level, religious belief, and language. Thus, various attributes jointly affect the network topology. An interesting problem is to detect community structure beyond some specific assortativity-related attributes $\rho$, i.e., to take out the effect of $\rho$ on network topology and reveal the hidden community structure which are due to other attributes. An approach to this problem is to redefine the null model of the modularity measure, so as to simulate the effect of $\rho$ on network topology. However, a challenge is that we do not know to what extent the network topology is affected by $\rho$ and by other attributes. In this paper, we propose Dist-Modularity which allows us to freely choose any suitable function to simulate the effect of $\rho$. Such freedom can help us probe the effect of $\rho$ and detect the hidden communities which are due to other attributes. We test the effectiveness of Dist-Modularity on synthetic benchmarks and two real-world networks.

10 pages, 8 figures

References in corpus (8)

• Fast unfolding of communities in large networks
• Finding community structure in networks using the eigenvectors of matrices
• Near linear time algorithm to detect community structures in large-scale networks
• Comparing community structure identification
• Detecting network communities by propagating labels under constraints
• The entropic origin of disassortativity in complex networks
• Comparative Evaluation of Community Detection Algorithms: A Topological Approach
• Multistep greedy algorithm identifies community structure in real-world and computer-generated networks