Scaling Properties of Multilayer Random Networks

Abstract

Multilayer networks are widespread in natural and manmade systems. Key properties of these networks are their spectral and eigenfunction characteristics, as they determine the critical properties of many dynamics occurring on top of them. In this paper, we numerically demonstrate that the normalized localization length $\beta$ of the eigenfunctions of multilayer random networks follows a simple scaling law given by $\beta =x^{\ast }/(1+x^{\ast })$, with $x^{\ast }=\gamma (b_{\text{eff}}^2/L{)}^{\delta }$, $\gamma ,\delta \sim 1$ and $b_{\text{eff}}$ being the effective bandwidth of the adjacency matrix of the network, whose size is $L=M\times N$. The reported scaling law for $\beta$ might help to better understand criticality in multilayer networks as well as to predict the eigenfunction localization properties of them.

8 pages, 7 figures. Submitted for publication

References in corpus (4)

• Diffusion dynamics on multiplex networks
• MuxViz: A Tool for Multilayer Analysis and Visualization of Networks
• Universality in the spectral and eigenfunction properties of random networks
• Von Neumann entropy and localization-delocalization transition of electron states in quantum small-world networks

Cited by in corpus (10)

• Spacing ratio characterization of the spectra of directed random networks
• Super-resolution community detection for layer-aggregated multilayer networks
• Topological versus spectral properties of random geometric graphs
• Normal mode analysis of spectra of random networks
• Geometrical and spectral study of $\beta$-skeleton graphs
• Universality of eigenvector delocalization and the nature of the SIS phase transition in multiplex networks
• Diluted banded random matrices: Scaling behavior of eigenfunction and spectral properties
• Spacing ratio statistics of multiplex directed networks
• Non-uniform random graphs on the plane: A scaling study
• Statistical properties of mutualistic-competitive random networks