Constrained community detection in multiplex networks

Abstract

Constrained community detection is a kind of community detection taking given constraints into account to improve the accuracy of community detection. Optimizing constrained Hamiltonian is one of the methods for constrained community detection. Constrained Hamiltonian consists of Hamiltonian which is generalized modularity and constrained term which takes given constraints into account. Nakata proposed a method for constrained community detection in monoplex networks based on the optimization of constrained Hamiltonian by extended Louvain method. In this paper, we propose a new method for constrained community detection in multiplex networks. Multiplex networks are the combinations of multiple individual networks. They can represent temporal networks or networks with several types of edges. While optimizing modularity proposed by Mucha et al. is popular for community detection in multiplex networks, our method optimizes the constrained Hamiltonian which we extend for multiplex networks. By using our proposed method, we successfully detect communities taking constraints into account. We also successfully improve the accuracy of community detection by using our method iteratively. Our method enables us to carry out constrained community detection interactively in multiplex networks.