Cycles and Clustering in Multiplex Networks

Abstract

In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of switches between layers. We calculate the expected number of cycles of each type in the configuration model of a large sparse multiplex network. Our method accounts for the full degree distribution including correlations between degrees in different layers. In particular, we obtain the numbers of cycles of length 3 of all possible types. Using these, we give a complete set of clustering coefficients and their expected values. We show that correlations between the degrees of a vertex in different layers strongly affect the number of cycles of a given type, and the number of switches between layers. Both increase with assortative correlations and are strongly decreased by disassortative correlations. The effect of correlations on clustering coefficients is equally pronounced.

5 pages, 4 figures

References in corpus (14)

• The structure and function of complex networks
• Multilayer Networks
• The structure and dynamics of multilayer networks
• The physics of spreading processes in multilayer networks
• Random Walks on Multiplex Networks
• Avalanche Collapse of Interdependent Network
• Coevolution and correlated multiplexity in multiplex networks
• Structure of Triadic Relations in Multiplex Networks
• The unreasonable effectiveness of tree-based theory for networks with clustering
• Bond percolation on multiplex networks
• Number of loops of size h in growing scale-free networks
• Loops of any size and Hamilton cycles in random scale-free networks
• Effect of degree correlations on the loop structure of scale-free networks
• A unified approach to percolation processes on multiplex networks

Cited by in corpus (1)

• A tensor-based unified approach for clustering coefficients in financial multiplex networks