Self-similarity of multilayer networks

Abstract Research on the self-similarity of multilayer networks is scarce, when compared to the extensive research conducted on the dynamics of these networks. In this paper, we use entropy to determine the edge weights in each sub-network, and apply the degree–degree distance to unify the weight values of connecting edges between different sub-networks, and unify the edges with different meanings in the multilayer network numerically. At this time, the multilayer network is compressed into a single-layer network, also known as the aggregated network. Furthermore, the self-similarity of the multilayer network is represented by analyzing the self-similarity of the aggregate network. The study of self-similarity was conducted on two classical fractal networks and a real-world multilayer network. The results show that multilayer networks exhibit more pronounced self-similarity, and the intensity of self-similarity in multilayer networks can vary with the connection mode of sub-networks.